./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001_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_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5779294efb07ac4ab2a10e97d71dcf7333b3f83a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:42:23,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:42:23,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:42:23,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:42:23,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:42:23,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:42:23,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:42:23,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:42:23,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:42:23,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:42:23,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:42:23,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:42:23,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:42:23,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:42:23,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:42:23,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:42:23,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:42:23,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:42:23,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:42:23,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:42:23,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:42:23,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:42:23,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:42:23,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:42:23,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:42:23,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:42:23,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:42:23,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:42:23,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:42:23,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:42:23,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:42:23,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:42:23,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:42:23,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:42:23,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:42:23,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:42:23,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:42:23,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:42:23,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:42:23,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:42:23,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:42:23,594 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:42:23,606 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:42:23,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:42:23,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:42:23,607 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:42:23,608 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:42:23,608 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:42:23,608 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:42:23,608 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:42:23,608 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:42:23,608 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:42:23,609 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:42:23,609 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:42:23,609 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:42:23,609 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:42:23,609 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:42:23,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:42:23,610 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:42:23,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:42:23,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:42:23,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:42:23,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:42:23,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:42:23,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:42:23,611 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:42:23,612 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:42:23,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:42:23,612 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:42:23,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:42:23,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:42:23,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:42:23,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:42:23,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:42:23,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:42:23,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:42:23,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:42:23,614 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:42:23,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:42:23,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:42:23,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:42:23,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:42:23,615 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5779294efb07ac4ab2a10e97d71dcf7333b3f83a [2019-12-07 10:42:23,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:42:23,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:42:23,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:42:23,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:42:23,740 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:42:23,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix001_power.opt.i [2019-12-07 10:42:23,787 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/data/e8142ba43/2cbfa11e3a31497eb91666237667e618/FLAG36be4112d [2019-12-07 10:42:24,228 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:42:24,228 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/sv-benchmarks/c/pthread-wmm/mix001_power.opt.i [2019-12-07 10:42:24,238 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/data/e8142ba43/2cbfa11e3a31497eb91666237667e618/FLAG36be4112d [2019-12-07 10:42:24,247 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/data/e8142ba43/2cbfa11e3a31497eb91666237667e618 [2019-12-07 10:42:24,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:42:24,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:42:24,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:24,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:42:24,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:42:24,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24, skipping insertion in model container [2019-12-07 10:42:24,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:42:24,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:42:24,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:24,583 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:42:24,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:42:24,690 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:42:24,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24 WrapperNode [2019-12-07 10:42:24,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:42:24,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:24,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:42:24,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:42:24,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:42:24,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:42:24,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:42:24,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:42:24,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... [2019-12-07 10:42:24,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:42:24,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:42:24,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:42:24,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:42:24,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:42:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:42:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:42:24,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:42:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:42:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:42:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:42:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:42:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:42:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:42:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:42:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:42:24,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:42:24,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:42:24,811 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:42:25,214 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:42:25,214 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:42:25,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:25 BoogieIcfgContainer [2019-12-07 10:42:25,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:42:25,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:42:25,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:42:25,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:42:25,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:42:24" (1/3) ... [2019-12-07 10:42:25,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef6a94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:25, skipping insertion in model container [2019-12-07 10:42:25,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:42:24" (2/3) ... [2019-12-07 10:42:25,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef6a94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:42:25, skipping insertion in model container [2019-12-07 10:42:25,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:25" (3/3) ... [2019-12-07 10:42:25,220 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i [2019-12-07 10:42:25,226 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:42:25,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:42:25,231 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:42:25,232 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:42:25,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,260 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,279 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:42:25,305 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:42:25,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:42:25,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:42:25,319 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:42:25,319 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:42:25,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:42:25,320 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:42:25,320 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:42:25,320 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:42:25,331 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 10:42:25,332 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 10:42:25,394 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 10:42:25,394 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:42:25,406 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:42:25,428 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 10:42:25,463 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 10:42:25,464 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:42:25,471 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 10:42:25,495 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 10:42:25,496 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:42:28,879 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 10:42:29,181 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 10:42:29,301 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-07 10:42:29,301 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 10:42:29,304 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 10:42:32,079 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 10:42:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 10:42:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:42:32,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:32,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:32,086 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:32,090 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-07 10:42:32,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:32,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473096275] [2019-12-07 10:42:32,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:32,241 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 10:42:32,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473096275] [2019-12-07 10:42:32,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:32,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:42:32,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416507093] [2019-12-07 10:42:32,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:32,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:32,256 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 10:42:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:32,650 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 10:42:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:32,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:42:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:32,900 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 10:42:32,900 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 10:42:32,901 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 10:42:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 10:42:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 10:42:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 10:42:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 10:42:34,418 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 10:42:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:34,420 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 10:42:34,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 10:42:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:42:34,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:34,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:34,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:34,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:34,424 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-07 10:42:34,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:34,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567541865] [2019-12-07 10:42:34,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:34,481 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 10:42:34,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567541865] [2019-12-07 10:42:34,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:34,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:34,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93530075] [2019-12-07 10:42:34,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:34,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:34,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:34,483 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 10:42:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:34,964 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-07 10:42:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:34,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:42:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:35,179 INFO L225 Difference]: With dead ends: 66122 [2019-12-07 10:42:35,179 INFO L226 Difference]: Without dead ends: 66092 [2019-12-07 10:42:35,180 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 10:42:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-07 10:42:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-07 10:42:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-07 10:42:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-07 10:42:37,028 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-07 10:42:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:37,028 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-07 10:42:37,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-07 10:42:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:42:37,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:37,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:42:37,035 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-07 10:42:37,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:37,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903816845] [2019-12-07 10:42:37,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:37,088 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 10:42:37,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903816845] [2019-12-07 10:42:37,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:37,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:37,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834821242] [2019-12-07 10:42:37,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:37,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:37,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:37,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:37,089 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-07 10:42:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:37,541 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-07 10:42:37,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:42:37,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:42:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:37,721 INFO L225 Difference]: With dead ends: 82254 [2019-12-07 10:42:37,721 INFO L226 Difference]: Without dead ends: 82226 [2019-12-07 10:42:37,721 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 10:42:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-07 10:42:40,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-07 10:42:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-07 10:42:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-07 10:42:40,748 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-07 10:42:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:40,748 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-07 10:42:40,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-07 10:42:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:42:40,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:40,755 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 10:42:40,756 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-07 10:42:40,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:40,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87448546] [2019-12-07 10:42:40,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:40,810 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 10:42:40,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87448546] [2019-12-07 10:42:40,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:40,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:42:40,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716578718] [2019-12-07 10:42:40,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:40,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:40,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:40,811 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-07 10:42:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:41,071 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-07 10:42:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:41,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:42:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:41,216 INFO L225 Difference]: With dead ends: 68874 [2019-12-07 10:42:41,216 INFO L226 Difference]: Without dead ends: 68874 [2019-12-07 10:42:41,216 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 10:42:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-07 10:42:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-07 10:42:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-07 10:42:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-07 10:42:42,984 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 18 [2019-12-07 10:42:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:42,984 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-07 10:42:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-07 10:42:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:42:42,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:42,998 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] [2019-12-07 10:42:42,998 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-07 10:42:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:42,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549254826] [2019-12-07 10:42:42,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:43,040 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 10:42:43,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549254826] [2019-12-07 10:42:43,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:43,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:43,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408236606] [2019-12-07 10:42:43,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:43,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:43,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:43,041 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-07 10:42:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:43,683 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-07 10:42:43,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:42:43,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:42:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:43,853 INFO L225 Difference]: With dead ends: 81922 [2019-12-07 10:42:43,853 INFO L226 Difference]: Without dead ends: 81870 [2019-12-07 10:42:43,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:42:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-07 10:42:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-07 10:42:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-07 10:42:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-07 10:42:45,723 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-07 10:42:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:45,723 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-07 10:42:45,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-07 10:42:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:42:45,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:45,787 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 10:42:45,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-07 10:42:45,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:45,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336090236] [2019-12-07 10:42:45,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:45,841 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 10:42:45,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336090236] [2019-12-07 10:42:45,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:45,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:45,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650878046] [2019-12-07 10:42:45,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:45,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:45,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:45,843 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 3 states. [2019-12-07 10:42:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:46,110 INFO L93 Difference]: Finished difference Result 68462 states and 266022 transitions. [2019-12-07 10:42:46,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:46,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 10:42:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:46,251 INFO L225 Difference]: With dead ends: 68462 [2019-12-07 10:42:46,251 INFO L226 Difference]: Without dead ends: 68462 [2019-12-07 10:42:46,252 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 10:42:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68462 states. [2019-12-07 10:42:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68462 to 68302. [2019-12-07 10:42:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68302 states. [2019-12-07 10:42:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68302 states to 68302 states and 265518 transitions. [2019-12-07 10:42:47,981 INFO L78 Accepts]: Start accepts. Automaton has 68302 states and 265518 transitions. Word has length 32 [2019-12-07 10:42:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:47,981 INFO L462 AbstractCegarLoop]: Abstraction has 68302 states and 265518 transitions. [2019-12-07 10:42:47,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 68302 states and 265518 transitions. [2019-12-07 10:42:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:42:48,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:48,038 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] [2019-12-07 10:42:48,038 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:48,038 INFO L82 PathProgramCache]: Analyzing trace with hash 325215007, now seen corresponding path program 1 times [2019-12-07 10:42:48,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:48,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141259772] [2019-12-07 10:42:48,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:48,094 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 10:42:48,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141259772] [2019-12-07 10:42:48,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:48,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:42:48,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680575905] [2019-12-07 10:42:48,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:42:48,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:48,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:42:48,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:48,095 INFO L87 Difference]: Start difference. First operand 68302 states and 265518 transitions. Second operand 4 states. [2019-12-07 10:42:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:48,355 INFO L93 Difference]: Finished difference Result 68250 states and 265338 transitions. [2019-12-07 10:42:48,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:48,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 10:42:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:48,496 INFO L225 Difference]: With dead ends: 68250 [2019-12-07 10:42:48,496 INFO L226 Difference]: Without dead ends: 68250 [2019-12-07 10:42:48,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:42:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68250 states. [2019-12-07 10:42:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68250 to 68250. [2019-12-07 10:42:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68250 states. [2019-12-07 10:42:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68250 states to 68250 states and 265338 transitions. [2019-12-07 10:42:50,282 INFO L78 Accepts]: Start accepts. Automaton has 68250 states and 265338 transitions. Word has length 33 [2019-12-07 10:42:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:50,283 INFO L462 AbstractCegarLoop]: Abstraction has 68250 states and 265338 transitions. [2019-12-07 10:42:50,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:42:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 68250 states and 265338 transitions. [2019-12-07 10:42:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:42:50,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:50,334 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] [2019-12-07 10:42:50,334 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1480995424, now seen corresponding path program 1 times [2019-12-07 10:42:50,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:50,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214527407] [2019-12-07 10:42:50,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:50,374 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 10:42:50,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214527407] [2019-12-07 10:42:50,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:50,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:42:50,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495549279] [2019-12-07 10:42:50,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:42:50,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:50,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:42:50,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:42:50,375 INFO L87 Difference]: Start difference. First operand 68250 states and 265338 transitions. Second operand 5 states. [2019-12-07 10:42:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:50,841 INFO L93 Difference]: Finished difference Result 103218 states and 405922 transitions. [2019-12-07 10:42:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:42:50,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:42:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:51,038 INFO L225 Difference]: With dead ends: 103218 [2019-12-07 10:42:51,038 INFO L226 Difference]: Without dead ends: 90610 [2019-12-07 10:42:51,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:42:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90610 states. [2019-12-07 10:42:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90610 to 90610. [2019-12-07 10:42:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90610 states. [2019-12-07 10:42:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90610 states to 90610 states and 357564 transitions. [2019-12-07 10:42:53,368 INFO L78 Accepts]: Start accepts. Automaton has 90610 states and 357564 transitions. Word has length 34 [2019-12-07 10:42:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:53,368 INFO L462 AbstractCegarLoop]: Abstraction has 90610 states and 357564 transitions. [2019-12-07 10:42:53,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:42:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 90610 states and 357564 transitions. [2019-12-07 10:42:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:42:53,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:53,458 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] [2019-12-07 10:42:53,458 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:53,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1405115850, now seen corresponding path program 2 times [2019-12-07 10:42:53,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:53,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010447834] [2019-12-07 10:42:53,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:53,492 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 10:42:53,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010447834] [2019-12-07 10:42:53,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:53,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:42:53,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762961158] [2019-12-07 10:42:53,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:42:53,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:42:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:42:53,494 INFO L87 Difference]: Start difference. First operand 90610 states and 357564 transitions. Second operand 3 states. [2019-12-07 10:42:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:53,849 INFO L93 Difference]: Finished difference Result 89816 states and 354195 transitions. [2019-12-07 10:42:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:42:53,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 10:42:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:54,038 INFO L225 Difference]: With dead ends: 89816 [2019-12-07 10:42:54,038 INFO L226 Difference]: Without dead ends: 89816 [2019-12-07 10:42:54,038 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 10:42:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89816 states. [2019-12-07 10:42:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89816 to 89816. [2019-12-07 10:42:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89816 states. [2019-12-07 10:42:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89816 states to 89816 states and 354195 transitions. [2019-12-07 10:42:56,084 INFO L78 Accepts]: Start accepts. Automaton has 89816 states and 354195 transitions. Word has length 34 [2019-12-07 10:42:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:42:56,085 INFO L462 AbstractCegarLoop]: Abstraction has 89816 states and 354195 transitions. [2019-12-07 10:42:56,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:42:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 89816 states and 354195 transitions. [2019-12-07 10:42:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:42:57,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:42:57,566 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] [2019-12-07 10:42:57,566 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:42:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:42:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 1 times [2019-12-07 10:42:57,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:42:57,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085324421] [2019-12-07 10:42:57,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:42:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:57,620 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 10:42:57,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085324421] [2019-12-07 10:42:57,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:57,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:42:57,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570154953] [2019-12-07 10:42:57,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:42:57,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:42:57,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:42:57,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:42:57,621 INFO L87 Difference]: Start difference. First operand 89816 states and 354195 transitions. Second operand 6 states. [2019-12-07 10:42:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:42:58,289 INFO L93 Difference]: Finished difference Result 145455 states and 568962 transitions. [2019-12-07 10:42:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:42:58,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 10:42:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:42:58,586 INFO L225 Difference]: With dead ends: 145455 [2019-12-07 10:42:58,586 INFO L226 Difference]: Without dead ends: 133499 [2019-12-07 10:42:58,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:42:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133499 states. [2019-12-07 10:43:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133499 to 101528. [2019-12-07 10:43:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101528 states. [2019-12-07 10:43:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101528 states to 101528 states and 400333 transitions. [2019-12-07 10:43:01,223 INFO L78 Accepts]: Start accepts. Automaton has 101528 states and 400333 transitions. Word has length 35 [2019-12-07 10:43:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:01,224 INFO L462 AbstractCegarLoop]: Abstraction has 101528 states and 400333 transitions. [2019-12-07 10:43:01,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:43:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 101528 states and 400333 transitions. [2019-12-07 10:43:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:43:01,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:01,331 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] [2019-12-07 10:43:01,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash -22818902, now seen corresponding path program 2 times [2019-12-07 10:43:01,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:01,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975019786] [2019-12-07 10:43:01,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:01,402 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 10:43:01,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975019786] [2019-12-07 10:43:01,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:01,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:43:01,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244095780] [2019-12-07 10:43:01,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:43:01,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:43:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:01,403 INFO L87 Difference]: Start difference. First operand 101528 states and 400333 transitions. Second operand 7 states. [2019-12-07 10:43:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:02,494 INFO L93 Difference]: Finished difference Result 155159 states and 606198 transitions. [2019-12-07 10:43:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:43:02,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 10:43:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:02,842 INFO L225 Difference]: With dead ends: 155159 [2019-12-07 10:43:02,842 INFO L226 Difference]: Without dead ends: 155159 [2019-12-07 10:43:02,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:43:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155159 states. [2019-12-07 10:43:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155159 to 136150. [2019-12-07 10:43:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136150 states. [2019-12-07 10:43:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136150 states to 136150 states and 536407 transitions. [2019-12-07 10:43:06,371 INFO L78 Accepts]: Start accepts. Automaton has 136150 states and 536407 transitions. Word has length 35 [2019-12-07 10:43:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:06,371 INFO L462 AbstractCegarLoop]: Abstraction has 136150 states and 536407 transitions. [2019-12-07 10:43:06,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:43:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 136150 states and 536407 transitions. [2019-12-07 10:43:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:43:06,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:06,511 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] [2019-12-07 10:43:06,511 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1411267042, now seen corresponding path program 3 times [2019-12-07 10:43:06,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:06,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353099904] [2019-12-07 10:43:06,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:06,618 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 10:43:06,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353099904] [2019-12-07 10:43:06,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:06,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:43:06,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978338818] [2019-12-07 10:43:06,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:43:06,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:43:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:06,619 INFO L87 Difference]: Start difference. First operand 136150 states and 536407 transitions. Second operand 7 states. [2019-12-07 10:43:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:07,605 INFO L93 Difference]: Finished difference Result 184804 states and 733333 transitions. [2019-12-07 10:43:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:43:07,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 10:43:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:08,037 INFO L225 Difference]: With dead ends: 184804 [2019-12-07 10:43:08,037 INFO L226 Difference]: Without dead ends: 184804 [2019-12-07 10:43:08,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:43:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184804 states. [2019-12-07 10:43:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184804 to 140112. [2019-12-07 10:43:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140112 states. [2019-12-07 10:43:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140112 states to 140112 states and 553114 transitions. [2019-12-07 10:43:13,364 INFO L78 Accepts]: Start accepts. Automaton has 140112 states and 553114 transitions. Word has length 35 [2019-12-07 10:43:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:13,365 INFO L462 AbstractCegarLoop]: Abstraction has 140112 states and 553114 transitions. [2019-12-07 10:43:13,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:43:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 140112 states and 553114 transitions. [2019-12-07 10:43:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:43:13,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:13,531 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] [2019-12-07 10:43:13,531 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:13,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2011599710, now seen corresponding path program 4 times [2019-12-07 10:43:13,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:13,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47763384] [2019-12-07 10:43:13,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:13,658 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 10:43:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47763384] [2019-12-07 10:43:13,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:13,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:43:13,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870574835] [2019-12-07 10:43:13,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:43:13,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:43:13,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:43:13,659 INFO L87 Difference]: Start difference. First operand 140112 states and 553114 transitions. Second operand 8 states. [2019-12-07 10:43:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:14,999 INFO L93 Difference]: Finished difference Result 218610 states and 866954 transitions. [2019-12-07 10:43:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:43:15,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 10:43:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:15,553 INFO L225 Difference]: With dead ends: 218610 [2019-12-07 10:43:15,553 INFO L226 Difference]: Without dead ends: 218610 [2019-12-07 10:43:15,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:43:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218610 states. [2019-12-07 10:43:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218610 to 139722. [2019-12-07 10:43:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139722 states. [2019-12-07 10:43:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139722 states to 139722 states and 551511 transitions. [2019-12-07 10:43:19,615 INFO L78 Accepts]: Start accepts. Automaton has 139722 states and 551511 transitions. Word has length 35 [2019-12-07 10:43:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:19,616 INFO L462 AbstractCegarLoop]: Abstraction has 139722 states and 551511 transitions. [2019-12-07 10:43:19,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:43:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 139722 states and 551511 transitions. [2019-12-07 10:43:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:43:19,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:19,781 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] [2019-12-07 10:43:19,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1491549338, now seen corresponding path program 5 times [2019-12-07 10:43:19,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641239418] [2019-12-07 10:43:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:19,850 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 10:43:19,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641239418] [2019-12-07 10:43:19,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:19,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:43:19,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895417889] [2019-12-07 10:43:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:43:19,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:43:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:43:19,851 INFO L87 Difference]: Start difference. First operand 139722 states and 551511 transitions. Second operand 8 states. [2019-12-07 10:43:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:21,457 INFO L93 Difference]: Finished difference Result 206285 states and 810819 transitions. [2019-12-07 10:43:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:43:21,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 10:43:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:21,891 INFO L225 Difference]: With dead ends: 206285 [2019-12-07 10:43:21,891 INFO L226 Difference]: Without dead ends: 187909 [2019-12-07 10:43:21,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:43:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187909 states. [2019-12-07 10:43:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187909 to 129114. [2019-12-07 10:43:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129114 states. [2019-12-07 10:43:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129114 states to 129114 states and 510606 transitions. [2019-12-07 10:43:25,537 INFO L78 Accepts]: Start accepts. Automaton has 129114 states and 510606 transitions. Word has length 35 [2019-12-07 10:43:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:25,538 INFO L462 AbstractCegarLoop]: Abstraction has 129114 states and 510606 transitions. [2019-12-07 10:43:25,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:43:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 129114 states and 510606 transitions. [2019-12-07 10:43:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:43:25,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:25,679 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] [2019-12-07 10:43:25,679 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1560400136, now seen corresponding path program 6 times [2019-12-07 10:43:25,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371504404] [2019-12-07 10:43:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:25,757 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 10:43:25,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371504404] [2019-12-07 10:43:25,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:25,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:43:25,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081361893] [2019-12-07 10:43:25,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:43:25,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:43:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:43:25,759 INFO L87 Difference]: Start difference. First operand 129114 states and 510606 transitions. Second operand 8 states. [2019-12-07 10:43:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:26,946 INFO L93 Difference]: Finished difference Result 210666 states and 832215 transitions. [2019-12-07 10:43:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:43:26,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 10:43:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:27,463 INFO L225 Difference]: With dead ends: 210666 [2019-12-07 10:43:27,463 INFO L226 Difference]: Without dead ends: 201058 [2019-12-07 10:43:27,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 10:43:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201058 states. [2019-12-07 10:43:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201058 to 111794. [2019-12-07 10:43:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111794 states. [2019-12-07 10:43:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111794 states to 111794 states and 439166 transitions. [2019-12-07 10:43:32,584 INFO L78 Accepts]: Start accepts. Automaton has 111794 states and 439166 transitions. Word has length 35 [2019-12-07 10:43:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:32,584 INFO L462 AbstractCegarLoop]: Abstraction has 111794 states and 439166 transitions. [2019-12-07 10:43:32,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:43:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111794 states and 439166 transitions. [2019-12-07 10:43:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 10:43:32,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:32,710 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] [2019-12-07 10:43:32,710 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1952510451, now seen corresponding path program 1 times [2019-12-07 10:43:32,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:32,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150952595] [2019-12-07 10:43:32,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:32,753 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 10:43:32,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150952595] [2019-12-07 10:43:32,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:32,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:43:32,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309292116] [2019-12-07 10:43:32,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:32,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:32,754 INFO L87 Difference]: Start difference. First operand 111794 states and 439166 transitions. Second operand 5 states. [2019-12-07 10:43:32,964 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 10:43:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:33,017 INFO L93 Difference]: Finished difference Result 13860 states and 47491 transitions. [2019-12-07 10:43:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:33,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 10:43:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:33,027 INFO L225 Difference]: With dead ends: 13860 [2019-12-07 10:43:33,028 INFO L226 Difference]: Without dead ends: 7728 [2019-12-07 10:43:33,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:43:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7728 states. [2019-12-07 10:43:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7728 to 7728. [2019-12-07 10:43:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7728 states. [2019-12-07 10:43:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7728 states to 7728 states and 22581 transitions. [2019-12-07 10:43:33,114 INFO L78 Accepts]: Start accepts. Automaton has 7728 states and 22581 transitions. Word has length 36 [2019-12-07 10:43:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:33,114 INFO L462 AbstractCegarLoop]: Abstraction has 7728 states and 22581 transitions. [2019-12-07 10:43:33,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7728 states and 22581 transitions. [2019-12-07 10:43:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:43:33,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:33,120 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 10:43:33,120 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:33,120 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-07 10:43:33,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:33,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557994866] [2019-12-07 10:43:33,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:33,174 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 10:43:33,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557994866] [2019-12-07 10:43:33,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:43:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522632020] [2019-12-07 10:43:33,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:43:33,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:43:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:43:33,176 INFO L87 Difference]: Start difference. First operand 7728 states and 22581 transitions. Second operand 6 states. [2019-12-07 10:43:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:33,229 INFO L93 Difference]: Finished difference Result 6380 states and 19488 transitions. [2019-12-07 10:43:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:43:33,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 10:43:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:33,236 INFO L225 Difference]: With dead ends: 6380 [2019-12-07 10:43:33,236 INFO L226 Difference]: Without dead ends: 6252 [2019-12-07 10:43:33,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:43:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6252 states. [2019-12-07 10:43:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6252 to 6228. [2019-12-07 10:43:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2019-12-07 10:43:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 19147 transitions. [2019-12-07 10:43:33,306 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 19147 transitions. Word has length 47 [2019-12-07 10:43:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:33,306 INFO L462 AbstractCegarLoop]: Abstraction has 6228 states and 19147 transitions. [2019-12-07 10:43:33,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:43:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 19147 transitions. [2019-12-07 10:43:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:43:33,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:33,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:33,311 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -86235555, now seen corresponding path program 1 times [2019-12-07 10:43:33,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:33,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109413893] [2019-12-07 10:43:33,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:33,499 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 10:43:33,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109413893] [2019-12-07 10:43:33,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:33,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 10:43:33,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982957677] [2019-12-07 10:43:33,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:43:33,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:33,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:43:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:43:33,500 INFO L87 Difference]: Start difference. First operand 6228 states and 19147 transitions. Second operand 13 states. [2019-12-07 10:43:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:34,828 INFO L93 Difference]: Finished difference Result 14502 states and 44004 transitions. [2019-12-07 10:43:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:43:34,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 10:43:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:34,851 INFO L225 Difference]: With dead ends: 14502 [2019-12-07 10:43:34,851 INFO L226 Difference]: Without dead ends: 11448 [2019-12-07 10:43:34,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-12-07 10:43:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2019-12-07 10:43:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 7078. [2019-12-07 10:43:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7078 states. [2019-12-07 10:43:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7078 states to 7078 states and 21672 transitions. [2019-12-07 10:43:34,956 INFO L78 Accepts]: Start accepts. Automaton has 7078 states and 21672 transitions. Word has length 62 [2019-12-07 10:43:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:34,956 INFO L462 AbstractCegarLoop]: Abstraction has 7078 states and 21672 transitions. [2019-12-07 10:43:34,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:43:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7078 states and 21672 transitions. [2019-12-07 10:43:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:43:34,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:34,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:34,962 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 379563741, now seen corresponding path program 2 times [2019-12-07 10:43:34,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:34,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682011457] [2019-12-07 10:43:34,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:34,996 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 10:43:34,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682011457] [2019-12-07 10:43:34,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:34,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:43:34,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029672021] [2019-12-07 10:43:34,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:43:34,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:43:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:43:34,998 INFO L87 Difference]: Start difference. First operand 7078 states and 21672 transitions. Second operand 4 states. [2019-12-07 10:43:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:35,026 INFO L93 Difference]: Finished difference Result 7577 states and 22803 transitions. [2019-12-07 10:43:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:43:35,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 10:43:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:35,031 INFO L225 Difference]: With dead ends: 7577 [2019-12-07 10:43:35,031 INFO L226 Difference]: Without dead ends: 4034 [2019-12-07 10:43:35,031 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 10:43:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2019-12-07 10:43:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2019-12-07 10:43:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-12-07 10:43:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 10685 transitions. [2019-12-07 10:43:35,077 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 10685 transitions. Word has length 62 [2019-12-07 10:43:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:35,077 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 10685 transitions. [2019-12-07 10:43:35,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:43:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 10685 transitions. [2019-12-07 10:43:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:43:35,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:35,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:35,081 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash -379647347, now seen corresponding path program 3 times [2019-12-07 10:43:35,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:35,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2227754] [2019-12-07 10:43:35,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:35,135 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 10:43:35,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2227754] [2019-12-07 10:43:35,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:35,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:43:35,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442284310] [2019-12-07 10:43:35,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:43:35,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:43:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:43:35,137 INFO L87 Difference]: Start difference. First operand 4034 states and 10685 transitions. Second operand 4 states. [2019-12-07 10:43:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:35,175 INFO L93 Difference]: Finished difference Result 4411 states and 11548 transitions. [2019-12-07 10:43:35,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:35,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 10:43:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:35,178 INFO L225 Difference]: With dead ends: 4411 [2019-12-07 10:43:35,178 INFO L226 Difference]: Without dead ends: 2935 [2019-12-07 10:43:35,178 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 10:43:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-12-07 10:43:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2605. [2019-12-07 10:43:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-07 10:43:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 6856 transitions. [2019-12-07 10:43:35,207 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 6856 transitions. Word has length 62 [2019-12-07 10:43:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:35,207 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 6856 transitions. [2019-12-07 10:43:35,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:43:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 6856 transitions. [2019-12-07 10:43:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:43:35,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:35,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:35,210 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:35,210 INFO L82 PathProgramCache]: Analyzing trace with hash -956676094, now seen corresponding path program 1 times [2019-12-07 10:43:35,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:35,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996684771] [2019-12-07 10:43:35,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:35,268 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 10:43:35,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996684771] [2019-12-07 10:43:35,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:35,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:43:35,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164611941] [2019-12-07 10:43:35,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:43:35,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:43:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:43:35,269 INFO L87 Difference]: Start difference. First operand 2605 states and 6856 transitions. Second operand 5 states. [2019-12-07 10:43:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:35,292 INFO L93 Difference]: Finished difference Result 2979 states and 7714 transitions. [2019-12-07 10:43:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:43:35,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 10:43:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:35,293 INFO L225 Difference]: With dead ends: 2979 [2019-12-07 10:43:35,293 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 10:43:35,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:43:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 10:43:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-07 10:43:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-07 10:43:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 955 transitions. [2019-12-07 10:43:35,299 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 955 transitions. Word has length 63 [2019-12-07 10:43:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:35,299 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 955 transitions. [2019-12-07 10:43:35,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:43:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 955 transitions. [2019-12-07 10:43:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:43:35,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:35,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:35,301 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 2 times [2019-12-07 10:43:35,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:35,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751833196] [2019-12-07 10:43:35,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:43:35,383 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 10:43:35,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751833196] [2019-12-07 10:43:35,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:43:35,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:43:35,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700255617] [2019-12-07 10:43:35,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:43:35,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:43:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:43:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:43:35,384 INFO L87 Difference]: Start difference. First operand 437 states and 955 transitions. Second operand 8 states. [2019-12-07 10:43:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:43:35,559 INFO L93 Difference]: Finished difference Result 943 states and 2025 transitions. [2019-12-07 10:43:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:43:35,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 10:43:35,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:43:35,560 INFO L225 Difference]: With dead ends: 943 [2019-12-07 10:43:35,560 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 10:43:35,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:43:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 10:43:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 528. [2019-12-07 10:43:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-12-07 10:43:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1120 transitions. [2019-12-07 10:43:35,564 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1120 transitions. Word has length 63 [2019-12-07 10:43:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:43:35,565 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 1120 transitions. [2019-12-07 10:43:35,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:43:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1120 transitions. [2019-12-07 10:43:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:43:35,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:43:35,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:43:35,566 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:43:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:43:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 3 times [2019-12-07 10:43:35,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:43:35,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620652416] [2019-12-07 10:43:35,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:43:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:43:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:43:35,659 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:43:35,659 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:43:35,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112|) |v_ULTIMATE.start_main_~#t17~0.offset_63| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= |v_ULTIMATE.start_main_~#t17~0.offset_63| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t17~0.base_112| 4)) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t17~0.base_112|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112| 1)) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_59|, ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_84|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t17~0.offset=|v_ULTIMATE.start_main_~#t17~0.offset_63|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ULTIMATE.start_main_~#t17~0.base=|v_ULTIMATE.start_main_~#t17~0.base_112|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t19~0.base, ULTIMATE.start_main_~#t18~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t17~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t18~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t19~0.offset, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t17~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:43:35,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t18~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11|) |v_ULTIMATE.start_main_~#t18~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t18~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t18~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t18~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t18~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t18~0.offset, #length] because there is no mapped edge [2019-12-07 10:43:35,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t19~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11|) |v_ULTIMATE.start_main_~#t19~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t19~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t19~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t19~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t19~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t19~0.base] because there is no mapped edge [2019-12-07 10:43:35,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:43:35,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In963181827 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In963181827 256) 0))) (or (and (= ~y$w_buff1~0_In963181827 |P2Thread1of1ForFork0_#t~ite28_Out963181827|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out963181827| ~y$w_buff0~0_In963181827) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In963181827, ~y$w_buff1~0=~y$w_buff1~0_In963181827, ~y$w_buff0~0=~y$w_buff0~0_In963181827, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In963181827} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out963181827|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In963181827, ~y$w_buff1~0=~y$w_buff1~0_In963181827, ~y$w_buff0~0=~y$w_buff0~0_In963181827, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In963181827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:43:35,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 10:43:35,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:43:35,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1108075295 256)))) (or (and (= ~y$mem_tmp~0_In-1108075295 |P2Thread1of1ForFork0_#t~ite48_Out-1108075295|) (not .cse0)) (and (= ~y~0_In-1108075295 |P2Thread1of1ForFork0_#t~ite48_Out-1108075295|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1108075295, ~y$flush_delayed~0=~y$flush_delayed~0_In-1108075295, ~y~0=~y~0_In-1108075295} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1108075295|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1108075295, ~y$flush_delayed~0=~y$flush_delayed~0_In-1108075295, ~y~0=~y~0_In-1108075295} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:43:35,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:43:35,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-452773627 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-452773627 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-452773627| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-452773627| ~y$w_buff0_used~0_In-452773627)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-452773627, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-452773627} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-452773627, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-452773627, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-452773627|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:43:35,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1514126184 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1514126184 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1514126184 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1514126184 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-1514126184| ~y$w_buff1_used~0_In-1514126184) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1514126184|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1514126184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1514126184, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1514126184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1514126184} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1514126184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1514126184, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1514126184, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1514126184|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1514126184} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:43:35,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-2132979279 ~y$r_buff0_thd3~0_Out-2132979279)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2132979279 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2132979279 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~y$r_buff0_thd3~0_Out-2132979279 0) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132979279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2132979279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132979279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2132979279, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2132979279|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:43:35,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1183653600 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1183653600 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1183653600 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1183653600 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1183653600 |P2Thread1of1ForFork0_#t~ite54_Out1183653600|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1183653600|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1183653600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1183653600, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1183653600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1183653600} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1183653600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1183653600, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1183653600|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1183653600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1183653600} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:43:35,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:43:35,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1559332185 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1559332185| ~y~0_In-1559332185) .cse0) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1559332185| ~y$mem_tmp~0_In-1559332185) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1559332185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1559332185, ~y~0=~y~0_In-1559332185} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1559332185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1559332185, ~y~0=~y~0_In-1559332185, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1559332185|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:43:35,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:43:35,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:43:35,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out106117198| |ULTIMATE.start_main_#t~ite58_Out106117198|)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In106117198 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In106117198 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In106117198 |ULTIMATE.start_main_#t~ite58_Out106117198|)) (and (= ~y~0_In106117198 |ULTIMATE.start_main_#t~ite58_Out106117198|) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In106117198, ~y~0=~y~0_In106117198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106117198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106117198} OutVars{~y$w_buff1~0=~y$w_buff1~0_In106117198, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out106117198|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out106117198|, ~y~0=~y~0_In106117198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106117198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106117198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:43:35,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In215607840 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In215607840 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out215607840|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In215607840 |ULTIMATE.start_main_#t~ite60_Out215607840|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In215607840, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In215607840} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out215607840|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In215607840, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In215607840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:43:35,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2131783354 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2131783354 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2131783354 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2131783354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out2131783354| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite61_Out2131783354| ~y$w_buff1_used~0_In2131783354) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2131783354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131783354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131783354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131783354} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out2131783354|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2131783354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131783354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131783354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131783354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:43:35,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In243882220 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In243882220 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out243882220|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In243882220 |ULTIMATE.start_main_#t~ite62_Out243882220|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In243882220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In243882220} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out243882220|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In243882220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In243882220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:43:35,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In708003878 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In708003878 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In708003878 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In708003878 256)))) (or (and (= ~y$r_buff1_thd0~0_In708003878 |ULTIMATE.start_main_#t~ite63_Out708003878|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out708003878|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In708003878, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In708003878, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708003878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708003878} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out708003878|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In708003878, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In708003878, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708003878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708003878} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:43:35,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:43:35,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:43:35 BasicIcfg [2019-12-07 10:43:35,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:43:35,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:43:35,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:43:35,752 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:43:35,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:42:25" (3/4) ... [2019-12-07 10:43:35,754 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:43:35,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_112|) |v_ULTIMATE.start_main_~#t17~0.offset_63| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= |v_ULTIMATE.start_main_~#t17~0.offset_63| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t17~0.base_112| 4)) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t17~0.base_112|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112|)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t17~0.base_112| 1)) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_59|, ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_84|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t17~0.offset=|v_ULTIMATE.start_main_~#t17~0.offset_63|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_36|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ULTIMATE.start_main_~#t17~0.base=|v_ULTIMATE.start_main_~#t17~0.base_112|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t19~0.base, ULTIMATE.start_main_~#t18~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t17~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t18~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t19~0.offset, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t17~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:43:35,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t18~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11|) |v_ULTIMATE.start_main_~#t18~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t18~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t18~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t18~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t18~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t18~0.offset, #length] because there is no mapped edge [2019-12-07 10:43:35,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t19~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11|) |v_ULTIMATE.start_main_~#t19~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t19~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t19~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t19~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t19~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t19~0.base] because there is no mapped edge [2019-12-07 10:43:35,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:43:35,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In963181827 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In963181827 256) 0))) (or (and (= ~y$w_buff1~0_In963181827 |P2Thread1of1ForFork0_#t~ite28_Out963181827|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out963181827| ~y$w_buff0~0_In963181827) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In963181827, ~y$w_buff1~0=~y$w_buff1~0_In963181827, ~y$w_buff0~0=~y$w_buff0~0_In963181827, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In963181827} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out963181827|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In963181827, ~y$w_buff1~0=~y$w_buff1~0_In963181827, ~y$w_buff0~0=~y$w_buff0~0_In963181827, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In963181827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:43:35,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 10:43:35,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 10:43:35,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1108075295 256)))) (or (and (= ~y$mem_tmp~0_In-1108075295 |P2Thread1of1ForFork0_#t~ite48_Out-1108075295|) (not .cse0)) (and (= ~y~0_In-1108075295 |P2Thread1of1ForFork0_#t~ite48_Out-1108075295|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1108075295, ~y$flush_delayed~0=~y$flush_delayed~0_In-1108075295, ~y~0=~y~0_In-1108075295} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1108075295|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1108075295, ~y$flush_delayed~0=~y$flush_delayed~0_In-1108075295, ~y~0=~y~0_In-1108075295} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:43:35,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:43:35,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-452773627 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-452773627 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-452773627| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-452773627| ~y$w_buff0_used~0_In-452773627)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-452773627, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-452773627} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-452773627, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-452773627, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-452773627|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 10:43:35,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1514126184 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1514126184 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1514126184 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1514126184 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out-1514126184| ~y$w_buff1_used~0_In-1514126184) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1514126184|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1514126184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1514126184, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1514126184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1514126184} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1514126184, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1514126184, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1514126184, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1514126184|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1514126184} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 10:43:35,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-2132979279 ~y$r_buff0_thd3~0_Out-2132979279)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2132979279 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2132979279 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~y$r_buff0_thd3~0_Out-2132979279 0) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132979279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2132979279} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132979279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2132979279, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2132979279|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 10:43:35,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1183653600 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1183653600 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1183653600 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1183653600 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1183653600 |P2Thread1of1ForFork0_#t~ite54_Out1183653600|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1183653600|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1183653600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1183653600, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1183653600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1183653600} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1183653600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1183653600, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1183653600|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1183653600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1183653600} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 10:43:35,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:43:35,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1559332185 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1559332185| ~y~0_In-1559332185) .cse0) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-1559332185| ~y$mem_tmp~0_In-1559332185) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1559332185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1559332185, ~y~0=~y~0_In-1559332185} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1559332185, ~y$flush_delayed~0=~y$flush_delayed~0_In-1559332185, ~y~0=~y~0_In-1559332185, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1559332185|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:43:35,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:43:35,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:43:35,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out106117198| |ULTIMATE.start_main_#t~ite58_Out106117198|)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In106117198 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In106117198 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In106117198 |ULTIMATE.start_main_#t~ite58_Out106117198|)) (and (= ~y~0_In106117198 |ULTIMATE.start_main_#t~ite58_Out106117198|) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In106117198, ~y~0=~y~0_In106117198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106117198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106117198} OutVars{~y$w_buff1~0=~y$w_buff1~0_In106117198, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out106117198|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out106117198|, ~y~0=~y~0_In106117198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In106117198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In106117198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:43:35,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In215607840 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In215607840 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out215607840|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In215607840 |ULTIMATE.start_main_#t~ite60_Out215607840|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In215607840, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In215607840} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out215607840|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In215607840, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In215607840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:43:35,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2131783354 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2131783354 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2131783354 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2131783354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out2131783354| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite61_Out2131783354| ~y$w_buff1_used~0_In2131783354) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2131783354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131783354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131783354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131783354} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out2131783354|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2131783354, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131783354, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131783354, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131783354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:43:35,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In243882220 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In243882220 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out243882220|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In243882220 |ULTIMATE.start_main_#t~ite62_Out243882220|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In243882220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In243882220} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out243882220|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In243882220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In243882220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:43:35,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In708003878 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In708003878 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In708003878 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In708003878 256)))) (or (and (= ~y$r_buff1_thd0~0_In708003878 |ULTIMATE.start_main_#t~ite63_Out708003878|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite63_Out708003878|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In708003878, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In708003878, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708003878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708003878} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out708003878|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In708003878, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In708003878, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In708003878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In708003878} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 10:43:35,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:43:35,836 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9337bb0c-dc8f-45a9-a52a-5e6a9cf8d40b/bin/utaipan/witness.graphml [2019-12-07 10:43:35,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:43:35,837 INFO L168 Benchmark]: Toolchain (without parser) took 71587.04 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 942.5 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 10:43:35,837 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:43:35,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:35,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:43:35,838 INFO L168 Benchmark]: Boogie Preprocessor took 27.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:35,838 INFO L168 Benchmark]: RCFGBuilder took 449.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:35,838 INFO L168 Benchmark]: TraceAbstraction took 70535.93 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 10:43:35,839 INFO L168 Benchmark]: Witness Printer took 83.92 ms. Allocated memory is still 6.6 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:43:35,840 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 449.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 70535.93 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 83.92 ms. Allocated memory is still 6.6 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5737 SDtfs, 9004 SDslu, 15614 SDs, 0 SdLazy, 4252 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140112occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 351533 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 877 NumberOfCodeBlocks, 877 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 225202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...