./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/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 0a0477737bb0156e2d4eb4c0a78a7e6e338f6bf0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:27:21,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:27:21,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:27:21,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:27:21,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:27:21,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:27:21,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:27:21,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:27:21,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:27:21,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:27:21,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:27:21,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:27:21,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:27:21,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:27:21,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:27:21,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:27:21,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:27:21,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:27:21,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:27:21,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:27:21,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:27:21,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:27:21,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:27:21,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:27:21,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:27:21,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:27:21,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:27:21,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:27:21,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:27:21,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:27:21,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:27:21,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:27:21,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:27:21,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:27:21,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:27:21,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:27:21,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:27:21,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:27:21,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:27:21,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:27:21,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:27:21,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:27:21,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:27:21,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:27:21,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:27:21,650 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:27:21,651 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:27:21,651 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:27:21,652 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:27:21,652 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:27:21,652 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:27:21,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:27:21,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:27:21,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:27:21,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:27:21,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:27:21,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:27:21,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:27:21,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:27:21,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:27:21,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:27:21,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:27:21,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:27:21,656 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_910ee94a-de86-4b03-bb6d-323d4cd58164/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 -> 0a0477737bb0156e2d4eb4c0a78a7e6e338f6bf0 [2019-12-07 19:27:21,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:27:21,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:27:21,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:27:21,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:27:21,768 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:27:21,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe021_power.oepc.i [2019-12-07 19:27:21,806 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/data/45ac7f566/4bf72e8f1f1d4a9ab87b5a8f5397f677/FLAG288f11746 [2019-12-07 19:27:22,356 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:27:22,356 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/sv-benchmarks/c/pthread-wmm/safe021_power.oepc.i [2019-12-07 19:27:22,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/data/45ac7f566/4bf72e8f1f1d4a9ab87b5a8f5397f677/FLAG288f11746 [2019-12-07 19:27:22,797 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/data/45ac7f566/4bf72e8f1f1d4a9ab87b5a8f5397f677 [2019-12-07 19:27:22,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:27:22,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:27:22,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:27:22,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:27:22,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:27:22,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:27:22" (1/1) ... [2019-12-07 19:27:22,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6fc423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:22, skipping insertion in model container [2019-12-07 19:27:22,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:27:22" (1/1) ... [2019-12-07 19:27:22,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:27:22,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:27:23,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:27:23,099 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:27:23,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:27:23,187 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:27:23,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23 WrapperNode [2019-12-07 19:27:23,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:27:23,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:27:23,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:27:23,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:27:23,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:27:23,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:27:23,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:27:23,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:27:23,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... [2019-12-07 19:27:23,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:27:23,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:27:23,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:27:23,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:27:23,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/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 19:27:23,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:27:23,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:27:23,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:27:23,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:27:23,296 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:27:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:27:23,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:27:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:27:23,296 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:27:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:27:23,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:27:23,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:27:23,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:27:23,298 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 19:27:23,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:27:23,677 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:27:23,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:27:23 BoogieIcfgContainer [2019-12-07 19:27:23,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:27:23,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:27:23,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:27:23,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:27:23,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:27:22" (1/3) ... [2019-12-07 19:27:23,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81a7bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:27:23, skipping insertion in model container [2019-12-07 19:27:23,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:27:23" (2/3) ... [2019-12-07 19:27:23,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81a7bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:27:23, skipping insertion in model container [2019-12-07 19:27:23,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:27:23" (3/3) ... [2019-12-07 19:27:23,683 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2019-12-07 19:27:23,689 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:27:23,690 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:27:23,694 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:27:23,695 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:27:23,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:27:23,762 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:27:23,775 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:27:23,775 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:27:23,775 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:27:23,775 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:27:23,775 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:27:23,775 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:27:23,775 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:27:23,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:27:23,786 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-07 19:27:23,787 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 19:27:23,844 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 19:27:23,844 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:27:23,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:27:23,871 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-07 19:27:23,904 INFO L134 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-07 19:27:23,904 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:27:23,909 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 702 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:27:23,925 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 19:27:23,925 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:27:27,096 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:27:27,371 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-07 19:27:27,371 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 19:27:27,374 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-07 19:27:41,743 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-07 19:27:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-07 19:27:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:27:41,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:27:41,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:27:41,750 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:27:41,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:27:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-07 19:27:41,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:27:41,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892986282] [2019-12-07 19:27:41,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:27:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:27:41,885 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 19:27:41,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892986282] [2019-12-07 19:27:41,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:27:41,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:27:41,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922548671] [2019-12-07 19:27:41,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:27:41,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:27:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:27:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:27:41,900 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-07 19:27:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:27:42,711 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-07 19:27:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:27:42,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:27:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:27:43,096 INFO L225 Difference]: With dead ends: 110910 [2019-12-07 19:27:43,096 INFO L226 Difference]: Without dead ends: 98066 [2019-12-07 19:27:43,097 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 19:27:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-07 19:27:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-07 19:27:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-07 19:27:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-07 19:27:48,098 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-07 19:27:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:27:48,099 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-07 19:27:48,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:27:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-07 19:27:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:27:48,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:27:48,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:27:48,103 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:27:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:27:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-07 19:27:48,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:27:48,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181651131] [2019-12-07 19:27:48,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:27:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:27:48,163 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 19:27:48,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181651131] [2019-12-07 19:27:48,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:27:48,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:27:48,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107378182] [2019-12-07 19:27:48,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:27:48,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:27:48,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:27:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:27:48,165 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-07 19:27:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:27:49,162 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-07 19:27:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:27:49,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:27:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:27:49,570 INFO L225 Difference]: With dead ends: 156656 [2019-12-07 19:27:49,570 INFO L226 Difference]: Without dead ends: 156558 [2019-12-07 19:27:49,571 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 19:27:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-07 19:27:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-07 19:27:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-07 19:27:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-07 19:27:58,721 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-07 19:27:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:27:58,722 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-07 19:27:58,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:27:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-07 19:27:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:27:58,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:27:58,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:27:58,727 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:27:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:27:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-07 19:27:58,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:27:58,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702241474] [2019-12-07 19:27:58,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:27:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:27:58,784 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 19:27:58,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702241474] [2019-12-07 19:27:58,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:27:58,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:27:58,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924032683] [2019-12-07 19:27:58,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:27:58,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:27:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:27:58,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:27:58,785 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 4 states. [2019-12-07 19:27:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:27:59,919 INFO L93 Difference]: Finished difference Result 205190 states and 828176 transitions. [2019-12-07 19:27:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:27:59,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:27:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:00,461 INFO L225 Difference]: With dead ends: 205190 [2019-12-07 19:28:00,461 INFO L226 Difference]: Without dead ends: 205078 [2019-12-07 19:28:00,462 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 19:28:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205078 states. [2019-12-07 19:28:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205078 to 171310. [2019-12-07 19:28:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171310 states. [2019-12-07 19:28:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171310 states to 171310 states and 704416 transitions. [2019-12-07 19:28:10,477 INFO L78 Accepts]: Start accepts. Automaton has 171310 states and 704416 transitions. Word has length 13 [2019-12-07 19:28:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:10,478 INFO L462 AbstractCegarLoop]: Abstraction has 171310 states and 704416 transitions. [2019-12-07 19:28:10,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:28:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 171310 states and 704416 transitions. [2019-12-07 19:28:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:28:10,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:10,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:10,485 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-07 19:28:10,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:10,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598644142] [2019-12-07 19:28:10,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:10,536 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 19:28:10,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598644142] [2019-12-07 19:28:10,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:10,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:28:10,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188174064] [2019-12-07 19:28:10,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:28:10,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:28:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:28:10,537 INFO L87 Difference]: Start difference. First operand 171310 states and 704416 transitions. Second operand 5 states. [2019-12-07 19:28:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:11,783 INFO L93 Difference]: Finished difference Result 231848 states and 943034 transitions. [2019-12-07 19:28:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:28:11,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 19:28:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:12,880 INFO L225 Difference]: With dead ends: 231848 [2019-12-07 19:28:12,880 INFO L226 Difference]: Without dead ends: 231848 [2019-12-07 19:28:12,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:28:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231848 states. [2019-12-07 19:28:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231848 to 191437. [2019-12-07 19:28:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191437 states. [2019-12-07 19:28:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191437 states to 191437 states and 785356 transitions. [2019-12-07 19:28:23,803 INFO L78 Accepts]: Start accepts. Automaton has 191437 states and 785356 transitions. Word has length 16 [2019-12-07 19:28:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 191437 states and 785356 transitions. [2019-12-07 19:28:23,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:28:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 191437 states and 785356 transitions. [2019-12-07 19:28:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:28:23,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:23,818 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 19:28:23,818 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1118041263, now seen corresponding path program 1 times [2019-12-07 19:28:23,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545602658] [2019-12-07 19:28:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:23,855 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 19:28:23,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545602658] [2019-12-07 19:28:23,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:23,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:28:23,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410050672] [2019-12-07 19:28:23,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:23,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:23,857 INFO L87 Difference]: Start difference. First operand 191437 states and 785356 transitions. Second operand 3 states. [2019-12-07 19:28:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:25,034 INFO L93 Difference]: Finished difference Result 191437 states and 777824 transitions. [2019-12-07 19:28:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:25,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:28:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:25,505 INFO L225 Difference]: With dead ends: 191437 [2019-12-07 19:28:25,505 INFO L226 Difference]: Without dead ends: 191437 [2019-12-07 19:28:25,505 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 19:28:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191437 states. [2019-12-07 19:28:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191437 to 188487. [2019-12-07 19:28:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188487 states. [2019-12-07 19:28:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188487 states to 188487 states and 766908 transitions. [2019-12-07 19:28:33,948 INFO L78 Accepts]: Start accepts. Automaton has 188487 states and 766908 transitions. Word has length 18 [2019-12-07 19:28:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:33,949 INFO L462 AbstractCegarLoop]: Abstraction has 188487 states and 766908 transitions. [2019-12-07 19:28:33,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 188487 states and 766908 transitions. [2019-12-07 19:28:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:28:33,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:33,959 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 19:28:33,959 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:33,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2016155527, now seen corresponding path program 1 times [2019-12-07 19:28:33,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:33,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553338629] [2019-12-07 19:28:33,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:34,006 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 19:28:34,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553338629] [2019-12-07 19:28:34,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:34,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:28:34,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77584137] [2019-12-07 19:28:34,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:28:34,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:28:34,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:28:34,008 INFO L87 Difference]: Start difference. First operand 188487 states and 766908 transitions. Second operand 3 states. [2019-12-07 19:28:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:35,428 INFO L93 Difference]: Finished difference Result 338301 states and 1366605 transitions. [2019-12-07 19:28:35,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:28:35,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:28:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:36,203 INFO L225 Difference]: With dead ends: 338301 [2019-12-07 19:28:36,203 INFO L226 Difference]: Without dead ends: 305208 [2019-12-07 19:28:36,204 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 19:28:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305208 states. [2019-12-07 19:28:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305208 to 291136. [2019-12-07 19:28:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291136 states. [2019-12-07 19:28:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291136 states to 291136 states and 1185531 transitions. [2019-12-07 19:28:50,481 INFO L78 Accepts]: Start accepts. Automaton has 291136 states and 1185531 transitions. Word has length 18 [2019-12-07 19:28:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:28:50,481 INFO L462 AbstractCegarLoop]: Abstraction has 291136 states and 1185531 transitions. [2019-12-07 19:28:50,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:28:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 291136 states and 1185531 transitions. [2019-12-07 19:28:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:28:50,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:28:50,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:28:50,501 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:28:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:28:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1466525918, now seen corresponding path program 1 times [2019-12-07 19:28:50,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:28:50,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548569828] [2019-12-07 19:28:50,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:28:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:28:50,559 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 19:28:50,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548569828] [2019-12-07 19:28:50,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:28:50,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:28:50,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447623934] [2019-12-07 19:28:50,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:28:50,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:28:50,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:28:50,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:28:50,561 INFO L87 Difference]: Start difference. First operand 291136 states and 1185531 transitions. Second operand 4 states. [2019-12-07 19:28:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:28:52,280 INFO L93 Difference]: Finished difference Result 303335 states and 1222970 transitions. [2019-12-07 19:28:52,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:28:52,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 19:28:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:28:53,035 INFO L225 Difference]: With dead ends: 303335 [2019-12-07 19:28:53,035 INFO L226 Difference]: Without dead ends: 303335 [2019-12-07 19:28:53,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 19:29:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303335 states. [2019-12-07 19:29:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303335 to 285168. [2019-12-07 19:29:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285168 states. [2019-12-07 19:29:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285168 states to 285168 states and 1160482 transitions. [2019-12-07 19:29:07,655 INFO L78 Accepts]: Start accepts. Automaton has 285168 states and 1160482 transitions. Word has length 19 [2019-12-07 19:29:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:07,655 INFO L462 AbstractCegarLoop]: Abstraction has 285168 states and 1160482 transitions. [2019-12-07 19:29:07,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:29:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 285168 states and 1160482 transitions. [2019-12-07 19:29:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:29:07,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:07,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:07,674 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1757364841, now seen corresponding path program 1 times [2019-12-07 19:29:07,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:07,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978394039] [2019-12-07 19:29:07,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:07,715 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 19:29:07,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978394039] [2019-12-07 19:29:07,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:07,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:07,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904612034] [2019-12-07 19:29:07,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:29:07,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:07,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:29:07,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:07,717 INFO L87 Difference]: Start difference. First operand 285168 states and 1160482 transitions. Second operand 4 states. [2019-12-07 19:29:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:09,443 INFO L93 Difference]: Finished difference Result 302744 states and 1220925 transitions. [2019-12-07 19:29:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:29:09,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 19:29:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:10,201 INFO L225 Difference]: With dead ends: 302744 [2019-12-07 19:29:10,201 INFO L226 Difference]: Without dead ends: 302744 [2019-12-07 19:29:10,201 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 19:29:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302744 states. [2019-12-07 19:29:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302744 to 281786. [2019-12-07 19:29:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281786 states. [2019-12-07 19:29:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281786 states to 281786 states and 1147719 transitions. [2019-12-07 19:29:24,967 INFO L78 Accepts]: Start accepts. Automaton has 281786 states and 1147719 transitions. Word has length 19 [2019-12-07 19:29:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:24,967 INFO L462 AbstractCegarLoop]: Abstraction has 281786 states and 1147719 transitions. [2019-12-07 19:29:24,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:29:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 281786 states and 1147719 transitions. [2019-12-07 19:29:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:29:24,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:24,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:24,983 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1265267965, now seen corresponding path program 1 times [2019-12-07 19:29:24,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:24,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058528752] [2019-12-07 19:29:24,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:25,030 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 19:29:25,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058528752] [2019-12-07 19:29:25,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:25,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:29:25,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779061068] [2019-12-07 19:29:25,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:29:25,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:29:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:29:25,031 INFO L87 Difference]: Start difference. First operand 281786 states and 1147719 transitions. Second operand 5 states. [2019-12-07 19:29:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:27,356 INFO L93 Difference]: Finished difference Result 380791 states and 1524716 transitions. [2019-12-07 19:29:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:29:27,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 19:29:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:28,292 INFO L225 Difference]: With dead ends: 380791 [2019-12-07 19:29:28,292 INFO L226 Difference]: Without dead ends: 380609 [2019-12-07 19:29:28,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 19:29:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380609 states. [2019-12-07 19:29:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380609 to 292255. [2019-12-07 19:29:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292255 states. [2019-12-07 19:29:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292255 states to 292255 states and 1189343 transitions. [2019-12-07 19:29:41,657 INFO L78 Accepts]: Start accepts. Automaton has 292255 states and 1189343 transitions. Word has length 19 [2019-12-07 19:29:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:41,657 INFO L462 AbstractCegarLoop]: Abstraction has 292255 states and 1189343 transitions. [2019-12-07 19:29:41,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:29:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 292255 states and 1189343 transitions. [2019-12-07 19:29:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:29:41,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:41,681 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] [2019-12-07 19:29:41,681 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1948660060, now seen corresponding path program 1 times [2019-12-07 19:29:41,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:41,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139137505] [2019-12-07 19:29:41,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:41,709 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 19:29:41,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139137505] [2019-12-07 19:29:41,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:41,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:41,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567975777] [2019-12-07 19:29:41,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:29:41,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:29:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:41,711 INFO L87 Difference]: Start difference. First operand 292255 states and 1189343 transitions. Second operand 4 states. [2019-12-07 19:29:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:46,990 INFO L93 Difference]: Finished difference Result 518536 states and 2112700 transitions. [2019-12-07 19:29:46,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:29:46,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 19:29:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:47,705 INFO L225 Difference]: With dead ends: 518536 [2019-12-07 19:29:47,705 INFO L226 Difference]: Without dead ends: 275976 [2019-12-07 19:29:47,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 19:29:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275976 states. [2019-12-07 19:29:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275976 to 273684. [2019-12-07 19:29:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273684 states. [2019-12-07 19:29:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273684 states to 273684 states and 1104723 transitions. [2019-12-07 19:29:58,323 INFO L78 Accepts]: Start accepts. Automaton has 273684 states and 1104723 transitions. Word has length 20 [2019-12-07 19:29:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:58,324 INFO L462 AbstractCegarLoop]: Abstraction has 273684 states and 1104723 transitions. [2019-12-07 19:29:58,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:29:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 273684 states and 1104723 transitions. [2019-12-07 19:29:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:29:58,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:58,345 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] [2019-12-07 19:29:58,345 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1503194098, now seen corresponding path program 2 times [2019-12-07 19:29:58,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:58,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464798864] [2019-12-07 19:29:58,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:58,365 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 19:29:58,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464798864] [2019-12-07 19:29:58,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:58,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194099995] [2019-12-07 19:29:58,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:29:58,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:29:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:58,367 INFO L87 Difference]: Start difference. First operand 273684 states and 1104723 transitions. Second operand 3 states. [2019-12-07 19:29:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:58,543 INFO L93 Difference]: Finished difference Result 55820 states and 177630 transitions. [2019-12-07 19:29:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:29:58,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:29:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:58,627 INFO L225 Difference]: With dead ends: 55820 [2019-12-07 19:29:58,628 INFO L226 Difference]: Without dead ends: 55820 [2019-12-07 19:29:58,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55820 states. [2019-12-07 19:29:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55820 to 55820. [2019-12-07 19:29:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55820 states. [2019-12-07 19:29:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55820 states to 55820 states and 177630 transitions. [2019-12-07 19:29:59,508 INFO L78 Accepts]: Start accepts. Automaton has 55820 states and 177630 transitions. Word has length 20 [2019-12-07 19:29:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:59,508 INFO L462 AbstractCegarLoop]: Abstraction has 55820 states and 177630 transitions. [2019-12-07 19:29:59,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:29:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55820 states and 177630 transitions. [2019-12-07 19:29:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:29:59,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:59,513 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 19:29:59,514 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-07 19:29:59,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:59,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607964535] [2019-12-07 19:29:59,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:59,552 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 19:29:59,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607964535] [2019-12-07 19:29:59,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:59,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:29:59,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711990830] [2019-12-07 19:29:59,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:29:59,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:29:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:29:59,553 INFO L87 Difference]: Start difference. First operand 55820 states and 177630 transitions. Second operand 6 states. [2019-12-07 19:30:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:00,700 INFO L93 Difference]: Finished difference Result 84530 states and 261877 transitions. [2019-12-07 19:30:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:30:00,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:30:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:00,818 INFO L225 Difference]: With dead ends: 84530 [2019-12-07 19:30:00,818 INFO L226 Difference]: Without dead ends: 84474 [2019-12-07 19:30:00,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:30:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84474 states. [2019-12-07 19:30:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84474 to 64411. [2019-12-07 19:30:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64411 states. [2019-12-07 19:30:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64411 states to 64411 states and 203034 transitions. [2019-12-07 19:30:02,026 INFO L78 Accepts]: Start accepts. Automaton has 64411 states and 203034 transitions. Word has length 22 [2019-12-07 19:30:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:02,026 INFO L462 AbstractCegarLoop]: Abstraction has 64411 states and 203034 transitions. [2019-12-07 19:30:02,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:30:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 64411 states and 203034 transitions. [2019-12-07 19:30:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:30:02,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:02,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:02,039 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-07 19:30:02,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:02,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767154672] [2019-12-07 19:30:02,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:02,082 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 19:30:02,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767154672] [2019-12-07 19:30:02,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:02,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:30:02,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801682503] [2019-12-07 19:30:02,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:30:02,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:30:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:30:02,084 INFO L87 Difference]: Start difference. First operand 64411 states and 203034 transitions. Second operand 6 states. [2019-12-07 19:30:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:02,564 INFO L93 Difference]: Finished difference Result 83769 states and 257907 transitions. [2019-12-07 19:30:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:30:02,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 19:30:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:02,942 INFO L225 Difference]: With dead ends: 83769 [2019-12-07 19:30:02,942 INFO L226 Difference]: Without dead ends: 83448 [2019-12-07 19:30:02,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:30:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83448 states. [2019-12-07 19:30:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83448 to 67614. [2019-12-07 19:30:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67614 states. [2019-12-07 19:30:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67614 states to 67614 states and 212108 transitions. [2019-12-07 19:30:04,070 INFO L78 Accepts]: Start accepts. Automaton has 67614 states and 212108 transitions. Word has length 27 [2019-12-07 19:30:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:04,071 INFO L462 AbstractCegarLoop]: Abstraction has 67614 states and 212108 transitions. [2019-12-07 19:30:04,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:30:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 67614 states and 212108 transitions. [2019-12-07 19:30:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 19:30:04,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:04,091 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] [2019-12-07 19:30:04,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1181071409, now seen corresponding path program 1 times [2019-12-07 19:30:04,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:04,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646844672] [2019-12-07 19:30:04,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:04,124 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 19:30:04,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646844672] [2019-12-07 19:30:04,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:04,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:04,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690406827] [2019-12-07 19:30:04,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:04,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:04,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:04,125 INFO L87 Difference]: Start difference. First operand 67614 states and 212108 transitions. Second operand 4 states. [2019-12-07 19:30:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:04,205 INFO L93 Difference]: Finished difference Result 25317 states and 75571 transitions. [2019-12-07 19:30:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:30:04,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 19:30:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:04,237 INFO L225 Difference]: With dead ends: 25317 [2019-12-07 19:30:04,237 INFO L226 Difference]: Without dead ends: 25310 [2019-12-07 19:30:04,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25310 states. [2019-12-07 19:30:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25310 to 23676. [2019-12-07 19:30:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23676 states. [2019-12-07 19:30:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23676 states to 23676 states and 70887 transitions. [2019-12-07 19:30:04,589 INFO L78 Accepts]: Start accepts. Automaton has 23676 states and 70887 transitions. Word has length 31 [2019-12-07 19:30:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:04,590 INFO L462 AbstractCegarLoop]: Abstraction has 23676 states and 70887 transitions. [2019-12-07 19:30:04,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23676 states and 70887 transitions. [2019-12-07 19:30:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:30:04,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:04,607 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 19:30:04,607 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:04,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-07 19:30:04,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:04,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839259956] [2019-12-07 19:30:04,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:04,668 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 19:30:04,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839259956] [2019-12-07 19:30:04,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:04,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:30:04,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983784938] [2019-12-07 19:30:04,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:30:04,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:30:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:30:04,670 INFO L87 Difference]: Start difference. First operand 23676 states and 70887 transitions. Second operand 7 states. [2019-12-07 19:30:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:05,377 INFO L93 Difference]: Finished difference Result 31760 states and 92180 transitions. [2019-12-07 19:30:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:30:05,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 19:30:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:05,411 INFO L225 Difference]: With dead ends: 31760 [2019-12-07 19:30:05,411 INFO L226 Difference]: Without dead ends: 31760 [2019-12-07 19:30:05,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:30:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31760 states. [2019-12-07 19:30:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31760 to 24224. [2019-12-07 19:30:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24224 states. [2019-12-07 19:30:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24224 states to 24224 states and 72357 transitions. [2019-12-07 19:30:05,828 INFO L78 Accepts]: Start accepts. Automaton has 24224 states and 72357 transitions. Word has length 33 [2019-12-07 19:30:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:05,828 INFO L462 AbstractCegarLoop]: Abstraction has 24224 states and 72357 transitions. [2019-12-07 19:30:05,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:30:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 24224 states and 72357 transitions. [2019-12-07 19:30:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:30:05,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:05,852 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] [2019-12-07 19:30:05,852 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1559668611, now seen corresponding path program 1 times [2019-12-07 19:30:05,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:05,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178460222] [2019-12-07 19:30:05,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:05,905 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 19:30:05,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178460222] [2019-12-07 19:30:05,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:05,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:30:05,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585442488] [2019-12-07 19:30:05,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:30:05,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:30:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:05,906 INFO L87 Difference]: Start difference. First operand 24224 states and 72357 transitions. Second operand 5 states. [2019-12-07 19:30:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:06,302 INFO L93 Difference]: Finished difference Result 33462 states and 99816 transitions. [2019-12-07 19:30:06,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:30:06,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 19:30:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:06,341 INFO L225 Difference]: With dead ends: 33462 [2019-12-07 19:30:06,341 INFO L226 Difference]: Without dead ends: 33462 [2019-12-07 19:30:06,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:30:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33462 states. [2019-12-07 19:30:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33462 to 30420. [2019-12-07 19:30:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30420 states. [2019-12-07 19:30:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30420 states to 30420 states and 91272 transitions. [2019-12-07 19:30:06,820 INFO L78 Accepts]: Start accepts. Automaton has 30420 states and 91272 transitions. Word has length 41 [2019-12-07 19:30:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:06,820 INFO L462 AbstractCegarLoop]: Abstraction has 30420 states and 91272 transitions. [2019-12-07 19:30:06,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:30:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 30420 states and 91272 transitions. [2019-12-07 19:30:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:30:06,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:06,849 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] [2019-12-07 19:30:06,849 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1910371961, now seen corresponding path program 2 times [2019-12-07 19:30:06,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:06,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459320446] [2019-12-07 19:30:06,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:06,893 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 19:30:06,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459320446] [2019-12-07 19:30:06,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:06,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:30:06,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775626335] [2019-12-07 19:30:06,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:30:06,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:30:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:06,894 INFO L87 Difference]: Start difference. First operand 30420 states and 91272 transitions. Second operand 5 states. [2019-12-07 19:30:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:06,983 INFO L93 Difference]: Finished difference Result 28181 states and 86307 transitions. [2019-12-07 19:30:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:06,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 19:30:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:07,019 INFO L225 Difference]: With dead ends: 28181 [2019-12-07 19:30:07,019 INFO L226 Difference]: Without dead ends: 27150 [2019-12-07 19:30:07,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27150 states. [2019-12-07 19:30:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27150 to 15699. [2019-12-07 19:30:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15699 states. [2019-12-07 19:30:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15699 states to 15699 states and 48485 transitions. [2019-12-07 19:30:07,321 INFO L78 Accepts]: Start accepts. Automaton has 15699 states and 48485 transitions. Word has length 41 [2019-12-07 19:30:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:07,321 INFO L462 AbstractCegarLoop]: Abstraction has 15699 states and 48485 transitions. [2019-12-07 19:30:07,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:30:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15699 states and 48485 transitions. [2019-12-07 19:30:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:30:07,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:07,335 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, 1, 1] [2019-12-07 19:30:07,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash -244099463, now seen corresponding path program 1 times [2019-12-07 19:30:07,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:07,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947373308] [2019-12-07 19:30:07,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:07,363 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 19:30:07,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947373308] [2019-12-07 19:30:07,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:07,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:07,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698098967] [2019-12-07 19:30:07,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:07,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:07,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:07,365 INFO L87 Difference]: Start difference. First operand 15699 states and 48485 transitions. Second operand 3 states. [2019-12-07 19:30:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:07,440 INFO L93 Difference]: Finished difference Result 22146 states and 68882 transitions. [2019-12-07 19:30:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:07,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 19:30:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:07,465 INFO L225 Difference]: With dead ends: 22146 [2019-12-07 19:30:07,465 INFO L226 Difference]: Without dead ends: 22146 [2019-12-07 19:30:07,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22146 states. [2019-12-07 19:30:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22146 to 17815. [2019-12-07 19:30:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17815 states. [2019-12-07 19:30:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17815 states to 17815 states and 55837 transitions. [2019-12-07 19:30:07,763 INFO L78 Accepts]: Start accepts. Automaton has 17815 states and 55837 transitions. Word has length 65 [2019-12-07 19:30:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:07,763 INFO L462 AbstractCegarLoop]: Abstraction has 17815 states and 55837 transitions. [2019-12-07 19:30:07,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 17815 states and 55837 transitions. [2019-12-07 19:30:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:30:07,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:07,779 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, 1, 1] [2019-12-07 19:30:07,779 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 163828837, now seen corresponding path program 1 times [2019-12-07 19:30:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:07,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672076794] [2019-12-07 19:30:07,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:07,855 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 19:30:07,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672076794] [2019-12-07 19:30:07,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:07,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:30:07,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706574015] [2019-12-07 19:30:07,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:30:07,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:30:07,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:30:07,857 INFO L87 Difference]: Start difference. First operand 17815 states and 55837 transitions. Second operand 7 states. [2019-12-07 19:30:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:08,589 INFO L93 Difference]: Finished difference Result 26412 states and 80781 transitions. [2019-12-07 19:30:08,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:30:08,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 19:30:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:08,620 INFO L225 Difference]: With dead ends: 26412 [2019-12-07 19:30:08,620 INFO L226 Difference]: Without dead ends: 26412 [2019-12-07 19:30:08,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:30:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26412 states. [2019-12-07 19:30:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26412 to 18115. [2019-12-07 19:30:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18115 states. [2019-12-07 19:30:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18115 states to 18115 states and 56819 transitions. [2019-12-07 19:30:08,953 INFO L78 Accepts]: Start accepts. Automaton has 18115 states and 56819 transitions. Word has length 65 [2019-12-07 19:30:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:08,954 INFO L462 AbstractCegarLoop]: Abstraction has 18115 states and 56819 transitions. [2019-12-07 19:30:08,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:30:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18115 states and 56819 transitions. [2019-12-07 19:30:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:30:08,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:08,970 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, 1, 1] [2019-12-07 19:30:08,970 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:08,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1796634723, now seen corresponding path program 2 times [2019-12-07 19:30:08,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:08,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455143016] [2019-12-07 19:30:08,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:09,010 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 19:30:09,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455143016] [2019-12-07 19:30:09,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:09,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:09,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936198776] [2019-12-07 19:30:09,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:09,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:09,011 INFO L87 Difference]: Start difference. First operand 18115 states and 56819 transitions. Second operand 3 states. [2019-12-07 19:30:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:09,097 INFO L93 Difference]: Finished difference Result 21496 states and 67208 transitions. [2019-12-07 19:30:09,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:09,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 19:30:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:09,122 INFO L225 Difference]: With dead ends: 21496 [2019-12-07 19:30:09,122 INFO L226 Difference]: Without dead ends: 21496 [2019-12-07 19:30:09,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 19:30:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21496 states. [2019-12-07 19:30:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21496 to 18247. [2019-12-07 19:30:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-12-07 19:30:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 57406 transitions. [2019-12-07 19:30:09,428 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 57406 transitions. Word has length 65 [2019-12-07 19:30:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:09,428 INFO L462 AbstractCegarLoop]: Abstraction has 18247 states and 57406 transitions. [2019-12-07 19:30:09,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 57406 transitions. [2019-12-07 19:30:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:09,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:09,444 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, 1, 1, 1] [2019-12-07 19:30:09,444 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:09,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1092185255, now seen corresponding path program 1 times [2019-12-07 19:30:09,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:09,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851577714] [2019-12-07 19:30:09,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:09,528 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 19:30:09,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851577714] [2019-12-07 19:30:09,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:09,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:30:09,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347623433] [2019-12-07 19:30:09,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:30:09,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:30:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:30:09,529 INFO L87 Difference]: Start difference. First operand 18247 states and 57406 transitions. Second operand 8 states. [2019-12-07 19:30:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:10,436 INFO L93 Difference]: Finished difference Result 26440 states and 80650 transitions. [2019-12-07 19:30:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 19:30:10,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 19:30:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:10,466 INFO L225 Difference]: With dead ends: 26440 [2019-12-07 19:30:10,466 INFO L226 Difference]: Without dead ends: 26440 [2019-12-07 19:30:10,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:30:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26440 states. [2019-12-07 19:30:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26440 to 18199. [2019-12-07 19:30:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18199 states. [2019-12-07 19:30:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18199 states to 18199 states and 57264 transitions. [2019-12-07 19:30:10,794 INFO L78 Accepts]: Start accepts. Automaton has 18199 states and 57264 transitions. Word has length 66 [2019-12-07 19:30:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:10,794 INFO L462 AbstractCegarLoop]: Abstraction has 18199 states and 57264 transitions. [2019-12-07 19:30:10,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:30:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18199 states and 57264 transitions. [2019-12-07 19:30:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:10,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:10,810 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, 1, 1, 1] [2019-12-07 19:30:10,810 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1107820844, now seen corresponding path program 1 times [2019-12-07 19:30:10,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:10,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351290279] [2019-12-07 19:30:10,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:10,842 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 19:30:10,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351290279] [2019-12-07 19:30:10,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:10,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:30:10,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370765156] [2019-12-07 19:30:10,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:10,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:10,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:10,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:10,843 INFO L87 Difference]: Start difference. First operand 18199 states and 57264 transitions. Second operand 4 states. [2019-12-07 19:30:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:11,047 INFO L93 Difference]: Finished difference Result 29089 states and 92284 transitions. [2019-12-07 19:30:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:11,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 19:30:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:11,082 INFO L225 Difference]: With dead ends: 29089 [2019-12-07 19:30:11,082 INFO L226 Difference]: Without dead ends: 29089 [2019-12-07 19:30:11,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:30:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29089 states. [2019-12-07 19:30:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29089 to 19573. [2019-12-07 19:30:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19573 states. [2019-12-07 19:30:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19573 states to 19573 states and 62220 transitions. [2019-12-07 19:30:11,493 INFO L78 Accepts]: Start accepts. Automaton has 19573 states and 62220 transitions. Word has length 66 [2019-12-07 19:30:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:11,493 INFO L462 AbstractCegarLoop]: Abstraction has 19573 states and 62220 transitions. [2019-12-07 19:30:11,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 19573 states and 62220 transitions. [2019-12-07 19:30:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:11,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:11,510 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, 1, 1, 1] [2019-12-07 19:30:11,510 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 831300439, now seen corresponding path program 1 times [2019-12-07 19:30:11,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:11,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787725216] [2019-12-07 19:30:11,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:11,547 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 19:30:11,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787725216] [2019-12-07 19:30:11,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:11,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:11,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537176418] [2019-12-07 19:30:11,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:11,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:11,549 INFO L87 Difference]: Start difference. First operand 19573 states and 62220 transitions. Second operand 4 states. [2019-12-07 19:30:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:11,634 INFO L93 Difference]: Finished difference Result 19573 states and 62025 transitions. [2019-12-07 19:30:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:30:11,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 19:30:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:11,657 INFO L225 Difference]: With dead ends: 19573 [2019-12-07 19:30:11,658 INFO L226 Difference]: Without dead ends: 19573 [2019-12-07 19:30:11,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 19:30:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19573 states. [2019-12-07 19:30:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19573 to 16672. [2019-12-07 19:30:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-07 19:30:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 52277 transitions. [2019-12-07 19:30:11,926 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 52277 transitions. Word has length 66 [2019-12-07 19:30:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:11,927 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 52277 transitions. [2019-12-07 19:30:11,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 52277 transitions. [2019-12-07 19:30:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:11,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:11,942 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, 1, 1, 1] [2019-12-07 19:30:11,942 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 169560169, now seen corresponding path program 2 times [2019-12-07 19:30:11,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:11,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444805851] [2019-12-07 19:30:11,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:11,991 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 19:30:11,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444805851] [2019-12-07 19:30:11,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:11,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:30:11,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455176814] [2019-12-07 19:30:11,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:30:11,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:11,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:30:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:30:11,992 INFO L87 Difference]: Start difference. First operand 16672 states and 52277 transitions. Second operand 7 states. [2019-12-07 19:30:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:12,278 INFO L93 Difference]: Finished difference Result 45452 states and 141157 transitions. [2019-12-07 19:30:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:30:12,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 19:30:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:12,315 INFO L225 Difference]: With dead ends: 45452 [2019-12-07 19:30:12,315 INFO L226 Difference]: Without dead ends: 32457 [2019-12-07 19:30:12,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:30:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32457 states. [2019-12-07 19:30:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32457 to 19404. [2019-12-07 19:30:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19404 states. [2019-12-07 19:30:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19404 states to 19404 states and 60780 transitions. [2019-12-07 19:30:12,688 INFO L78 Accepts]: Start accepts. Automaton has 19404 states and 60780 transitions. Word has length 66 [2019-12-07 19:30:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:12,688 INFO L462 AbstractCegarLoop]: Abstraction has 19404 states and 60780 transitions. [2019-12-07 19:30:12,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:30:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 19404 states and 60780 transitions. [2019-12-07 19:30:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:12,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:12,706 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, 1, 1, 1] [2019-12-07 19:30:12,706 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1263353665, now seen corresponding path program 3 times [2019-12-07 19:30:12,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:12,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978258155] [2019-12-07 19:30:12,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:12,754 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 19:30:12,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978258155] [2019-12-07 19:30:12,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:12,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:30:12,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886099741] [2019-12-07 19:30:12,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:30:12,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:30:12,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:30:12,755 INFO L87 Difference]: Start difference. First operand 19404 states and 60780 transitions. Second operand 7 states. [2019-12-07 19:30:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:13,067 INFO L93 Difference]: Finished difference Result 53907 states and 168040 transitions. [2019-12-07 19:30:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:30:13,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 19:30:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:13,119 INFO L225 Difference]: With dead ends: 53907 [2019-12-07 19:30:13,120 INFO L226 Difference]: Without dead ends: 41032 [2019-12-07 19:30:13,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:30:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41032 states. [2019-12-07 19:30:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41032 to 23380. [2019-12-07 19:30:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23380 states. [2019-12-07 19:30:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23380 states to 23380 states and 73759 transitions. [2019-12-07 19:30:13,596 INFO L78 Accepts]: Start accepts. Automaton has 23380 states and 73759 transitions. Word has length 66 [2019-12-07 19:30:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:13,596 INFO L462 AbstractCegarLoop]: Abstraction has 23380 states and 73759 transitions. [2019-12-07 19:30:13,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:30:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 23380 states and 73759 transitions. [2019-12-07 19:30:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:13,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:13,619 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, 1, 1, 1] [2019-12-07 19:30:13,619 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -10630351, now seen corresponding path program 4 times [2019-12-07 19:30:13,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:13,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927579952] [2019-12-07 19:30:13,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:13,677 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 19:30:13,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927579952] [2019-12-07 19:30:13,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:13,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:30:13,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320211883] [2019-12-07 19:30:13,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:30:13,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:30:13,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:30:13,679 INFO L87 Difference]: Start difference. First operand 23380 states and 73759 transitions. Second operand 7 states. [2019-12-07 19:30:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:13,962 INFO L93 Difference]: Finished difference Result 47695 states and 148119 transitions. [2019-12-07 19:30:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:30:13,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 19:30:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:14,013 INFO L225 Difference]: With dead ends: 47695 [2019-12-07 19:30:14,013 INFO L226 Difference]: Without dead ends: 41108 [2019-12-07 19:30:14,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:30:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41108 states. [2019-12-07 19:30:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41108 to 23688. [2019-12-07 19:30:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23688 states. [2019-12-07 19:30:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23688 states to 23688 states and 74710 transitions. [2019-12-07 19:30:14,511 INFO L78 Accepts]: Start accepts. Automaton has 23688 states and 74710 transitions. Word has length 66 [2019-12-07 19:30:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:14,512 INFO L462 AbstractCegarLoop]: Abstraction has 23688 states and 74710 transitions. [2019-12-07 19:30:14,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:30:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 23688 states and 74710 transitions. [2019-12-07 19:30:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:30:14,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:14,532 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, 1, 1, 1] [2019-12-07 19:30:14,532 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:14,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 5 times [2019-12-07 19:30:14,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:14,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025011085] [2019-12-07 19:30:14,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:14,573 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 19:30:14,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025011085] [2019-12-07 19:30:14,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:14,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:14,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874260613] [2019-12-07 19:30:14,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:14,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:14,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:14,574 INFO L87 Difference]: Start difference. First operand 23688 states and 74710 transitions. Second operand 3 states. [2019-12-07 19:30:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:14,628 INFO L93 Difference]: Finished difference Result 19954 states and 61661 transitions. [2019-12-07 19:30:14,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:14,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 19:30:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:14,652 INFO L225 Difference]: With dead ends: 19954 [2019-12-07 19:30:14,652 INFO L226 Difference]: Without dead ends: 19954 [2019-12-07 19:30:14,652 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 19:30:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19954 states. [2019-12-07 19:30:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19954 to 19100. [2019-12-07 19:30:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19100 states. [2019-12-07 19:30:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19100 states to 19100 states and 58894 transitions. [2019-12-07 19:30:14,922 INFO L78 Accepts]: Start accepts. Automaton has 19100 states and 58894 transitions. Word has length 66 [2019-12-07 19:30:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:14,922 INFO L462 AbstractCegarLoop]: Abstraction has 19100 states and 58894 transitions. [2019-12-07 19:30:14,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 19100 states and 58894 transitions. [2019-12-07 19:30:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:30:14,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:14,940 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, 1, 1, 1, 1] [2019-12-07 19:30:14,940 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-07 19:30:14,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:14,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126935445] [2019-12-07 19:30:14,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:15,080 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 19:30:15,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126935445] [2019-12-07 19:30:15,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:15,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:30:15,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650124123] [2019-12-07 19:30:15,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:30:15,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:15,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:30:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:30:15,082 INFO L87 Difference]: Start difference. First operand 19100 states and 58894 transitions. Second operand 11 states. [2019-12-07 19:30:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:18,172 INFO L93 Difference]: Finished difference Result 61593 states and 188899 transitions. [2019-12-07 19:30:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 19:30:18,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 19:30:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:18,226 INFO L225 Difference]: With dead ends: 61593 [2019-12-07 19:30:18,226 INFO L226 Difference]: Without dead ends: 45266 [2019-12-07 19:30:18,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 19:30:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45266 states. [2019-12-07 19:30:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45266 to 19097. [2019-12-07 19:30:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19097 states. [2019-12-07 19:30:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19097 states to 19097 states and 58260 transitions. [2019-12-07 19:30:18,680 INFO L78 Accepts]: Start accepts. Automaton has 19097 states and 58260 transitions. Word has length 67 [2019-12-07 19:30:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:18,680 INFO L462 AbstractCegarLoop]: Abstraction has 19097 states and 58260 transitions. [2019-12-07 19:30:18,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:30:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 19097 states and 58260 transitions. [2019-12-07 19:30:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:30:18,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:18,698 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, 1, 1, 1, 1] [2019-12-07 19:30:18,698 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 2 times [2019-12-07 19:30:18,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:18,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021677933] [2019-12-07 19:30:18,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:18,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 19:30:18,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021677933] [2019-12-07 19:30:18,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:18,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:30:18,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957828961] [2019-12-07 19:30:18,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:30:18,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:30:18,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:30:18,842 INFO L87 Difference]: Start difference. First operand 19097 states and 58260 transitions. Second operand 12 states. [2019-12-07 19:30:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:19,394 INFO L93 Difference]: Finished difference Result 31765 states and 96211 transitions. [2019-12-07 19:30:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:30:19,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 19:30:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:19,430 INFO L225 Difference]: With dead ends: 31765 [2019-12-07 19:30:19,430 INFO L226 Difference]: Without dead ends: 30900 [2019-12-07 19:30:19,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:30:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30900 states. [2019-12-07 19:30:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30900 to 18567. [2019-12-07 19:30:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18567 states. [2019-12-07 19:30:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18567 states to 18567 states and 56788 transitions. [2019-12-07 19:30:19,811 INFO L78 Accepts]: Start accepts. Automaton has 18567 states and 56788 transitions. Word has length 67 [2019-12-07 19:30:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:19,811 INFO L462 AbstractCegarLoop]: Abstraction has 18567 states and 56788 transitions. [2019-12-07 19:30:19,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:30:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 18567 states and 56788 transitions. [2019-12-07 19:30:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:30:19,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:19,828 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, 1, 1, 1, 1] [2019-12-07 19:30:19,828 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 3 times [2019-12-07 19:30:19,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:19,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724380600] [2019-12-07 19:30:19,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:30:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:30:19,918 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:30:19,918 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:30:19,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2281~0.base_26| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26|)) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26| 1)) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~z$r_buff1_thd0~0_133 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26|) |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2281~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ULTIMATE.start_main_~#t2281~0.offset=|v_ULTIMATE.start_main_~#t2281~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2281~0.base=|v_ULTIMATE.start_main_~#t2281~0.base_26|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2283~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2281~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2281~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2283~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2282~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 19:30:19,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2282~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2282~0.base_9| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9|) |v_ULTIMATE.start_main_~#t2282~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2282~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2282~0.offset, #length] because there is no mapped edge [2019-12-07 19:30:19,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_In486572563 ~z$w_buff1_used~0_Out486572563) (= ~z$w_buff0~0_Out486572563 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In486572563| P0Thread1of1ForFork0_~arg.offset_Out486572563) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out486572563)) (= P0Thread1of1ForFork0_~arg.base_Out486572563 |P0Thread1of1ForFork0_#in~arg.base_In486572563|) (= ~z$w_buff1~0_Out486572563 ~z$w_buff0~0_In486572563) (= 1 ~z$w_buff0_used~0_Out486572563) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out486572563| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out486572563) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out486572563 256))) (not (= (mod ~z$w_buff0_used~0_Out486572563 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out486572563|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In486572563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486572563, ~z$w_buff0~0=~z$w_buff0~0_In486572563, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In486572563|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In486572563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out486572563, ~z$w_buff0~0=~z$w_buff0~0_Out486572563, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out486572563, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out486572563, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In486572563|, ~z$w_buff1~0=~z$w_buff1~0_Out486572563, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out486572563, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out486572563|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out486572563} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 19:30:19,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2283~0.offset_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11|) |v_ULTIMATE.start_main_~#t2283~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2283~0.base_11| 0)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2283~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2283~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2283~0.offset, #length, ULTIMATE.start_main_~#t2283~0.base] because there is no mapped edge [2019-12-07 19:30:19,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-162847680 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-162847680 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-162847680| |P1Thread1of1ForFork1_#t~ite10_Out-162847680|))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-162847680| ~z~0_In-162847680)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-162847680| ~z$w_buff1~0_In-162847680) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-162847680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162847680, ~z$w_buff1~0=~z$w_buff1~0_In-162847680, ~z~0=~z~0_In-162847680} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-162847680|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-162847680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162847680, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-162847680|, ~z$w_buff1~0=~z$w_buff1~0_In-162847680, ~z~0=~z~0_In-162847680} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 19:30:19,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2107717262 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2107717262 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2107717262| ~z$w_buff0_used~0_In-2107717262) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2107717262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2107717262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2107717262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2107717262, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2107717262|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2107717262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:30:19,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1011184323 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1011184323 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1011184323 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1011184323 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1011184323|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1011184323 |P1Thread1of1ForFork1_#t~ite12_Out1011184323|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1011184323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1011184323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1011184323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1011184323} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1011184323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1011184323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1011184323, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1011184323|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1011184323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:30:19,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In185604816 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In185604816 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out185604816| 0)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out185604816| ~z$r_buff0_thd2~0_In185604816) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In185604816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out185604816|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In185604816} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:30:19,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1617959878 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out-1617959878| |P2Thread1of1ForFork2_#t~ite23_Out-1617959878|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1617959878 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1617959878 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1617959878 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1617959878 256)))) (= ~z$w_buff1~0_In-1617959878 |P2Thread1of1ForFork2_#t~ite23_Out-1617959878|)) (and (not .cse0) (= ~z$w_buff1~0_In-1617959878 |P2Thread1of1ForFork2_#t~ite24_Out-1617959878|) (= |P2Thread1of1ForFork2_#t~ite23_In-1617959878| |P2Thread1of1ForFork2_#t~ite23_Out-1617959878|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1617959878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1617959878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1617959878, ~z$w_buff1~0=~z$w_buff1~0_In-1617959878, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1617959878, ~weak$$choice2~0=~weak$$choice2~0_In-1617959878} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1617959878|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1617959878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1617959878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1617959878, ~z$w_buff1~0=~z$w_buff1~0_In-1617959878, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1617959878, ~weak$$choice2~0=~weak$$choice2~0_In-1617959878} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 19:30:19,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-540213841 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In-540213841| |P2Thread1of1ForFork2_#t~ite26_Out-540213841|) (= |P2Thread1of1ForFork2_#t~ite27_Out-540213841| ~z$w_buff0_used~0_In-540213841) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-540213841 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-540213841 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-540213841 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-540213841 256)) .cse1))) (= ~z$w_buff0_used~0_In-540213841 |P2Thread1of1ForFork2_#t~ite26_Out-540213841|) (= |P2Thread1of1ForFork2_#t~ite27_Out-540213841| |P2Thread1of1ForFork2_#t~ite26_Out-540213841|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-540213841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-540213841, ~weak$$choice2~0=~weak$$choice2~0_In-540213841} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-540213841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-540213841, ~weak$$choice2~0=~weak$$choice2~0_In-540213841, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-540213841|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 19:30:19,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1543466755 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1543466755 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1543466755 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1543466755 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1543466755|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In1543466755 |P1Thread1of1ForFork1_#t~ite14_Out1543466755|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1543466755, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1543466755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1543466755, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1543466755} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1543466755, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1543466755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1543466755, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1543466755|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1543466755} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:30:19,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:30:19,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-598548221 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-598548221 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-598548221 256))) (= 0 (mod ~z$w_buff0_used~0_In-598548221 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-598548221 256))))) (= |P2Thread1of1ForFork2_#t~ite30_Out-598548221| |P2Thread1of1ForFork2_#t~ite29_Out-598548221|) .cse1 (= ~z$w_buff1_used~0_In-598548221 |P2Thread1of1ForFork2_#t~ite29_Out-598548221|)) (and (= ~z$w_buff1_used~0_In-598548221 |P2Thread1of1ForFork2_#t~ite30_Out-598548221|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In-598548221| |P2Thread1of1ForFork2_#t~ite29_Out-598548221|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-598548221, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-598548221, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-598548221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-598548221, ~weak$$choice2~0=~weak$$choice2~0_In-598548221, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-598548221|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-598548221|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-598548221, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-598548221, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-598548221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-598548221, ~weak$$choice2~0=~weak$$choice2~0_In-598548221, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-598548221|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 19:30:19,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 19:30:19,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 19:30:19,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1110084360 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1110084360 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1110084360| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1110084360| ~z$w_buff0_used~0_In-1110084360)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1110084360} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1110084360|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1110084360} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:30:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In749542843 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In749542843 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In749542843 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In749542843 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out749542843| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out749542843| ~z$w_buff1_used~0_In749542843)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In749542843, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In749542843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In749542843, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In749542843} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out749542843|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In749542843, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In749542843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In749542843, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In749542843} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:30:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In141598029 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In141598029 256))) (.cse2 (= ~z$r_buff0_thd1~0_In141598029 ~z$r_buff0_thd1~0_Out141598029))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out141598029) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In141598029} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out141598029|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out141598029} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:30:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In506336193 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In506336193 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In506336193 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In506336193 256)))) (or (and (= ~z$r_buff1_thd1~0_In506336193 |P0Thread1of1ForFork0_#t~ite8_Out506336193|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out506336193|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In506336193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In506336193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In506336193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out506336193|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In506336193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In506336193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In506336193} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:30:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:30:19,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1913643947 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1913643947 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-1913643947| |P2Thread1of1ForFork2_#t~ite38_Out-1913643947|))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-1913643947| ~z$w_buff1~0_In-1913643947) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1913643947| ~z~0_In-1913643947) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1913643947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1913643947, ~z$w_buff1~0=~z$w_buff1~0_In-1913643947, ~z~0=~z~0_In-1913643947} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1913643947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1913643947, ~z$w_buff1~0=~z$w_buff1~0_In-1913643947, ~z~0=~z~0_In-1913643947, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1913643947|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1913643947|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 19:30:19,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In932769995 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In932769995 256) 0))) (or (and (= ~z$w_buff0_used~0_In932769995 |P2Thread1of1ForFork2_#t~ite40_Out932769995|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out932769995|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In932769995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In932769995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In932769995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In932769995, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out932769995|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 19:30:19,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1964528678 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1964528678 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1964528678 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1964528678 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1964528678 |P2Thread1of1ForFork2_#t~ite41_Out1964528678|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1964528678|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964528678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1964528678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964528678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964528678} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1964528678|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1964528678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1964528678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964528678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964528678} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 19:30:19,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In162128865 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In162128865 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out162128865|)) (and (= ~z$r_buff0_thd3~0_In162128865 |P2Thread1of1ForFork2_#t~ite42_Out162128865|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In162128865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In162128865} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out162128865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In162128865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In162128865} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 19:30:19,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-531084114 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-531084114 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-531084114 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-531084114 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-531084114| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-531084114 |P2Thread1of1ForFork2_#t~ite43_Out-531084114|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-531084114, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-531084114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531084114, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-531084114} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-531084114, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-531084114, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-531084114|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531084114, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-531084114} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 19:30:19,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:30:19,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:30:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In2100184046 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2100184046 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2100184046| |ULTIMATE.start_main_#t~ite48_Out2100184046|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out2100184046| ~z~0_In2100184046) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out2100184046| ~z$w_buff1~0_In2100184046) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2100184046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2100184046, ~z$w_buff1~0=~z$w_buff1~0_In2100184046, ~z~0=~z~0_In2100184046} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2100184046, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2100184046|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2100184046, ~z$w_buff1~0=~z$w_buff1~0_In2100184046, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2100184046|, ~z~0=~z~0_In2100184046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:30:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In245401685 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In245401685 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out245401685| 0)) (and (= ~z$w_buff0_used~0_In245401685 |ULTIMATE.start_main_#t~ite49_Out245401685|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In245401685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In245401685} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In245401685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In245401685, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out245401685|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 19:30:19,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In2061772868 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In2061772868 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2061772868 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2061772868 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2061772868|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2061772868 |ULTIMATE.start_main_#t~ite50_Out2061772868|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2061772868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2061772868, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2061772868|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2061772868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2061772868, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 19:30:19,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In848466720 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In848466720 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out848466720|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In848466720 |ULTIMATE.start_main_#t~ite51_Out848466720|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In848466720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In848466720} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In848466720, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out848466720|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In848466720} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 19:30:19,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-772023873 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-772023873 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-772023873 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-772023873 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-772023873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-772023873| ~z$r_buff1_thd0~0_In-772023873) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-772023873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-772023873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-772023873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-772023873} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-772023873|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-772023873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-772023873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-772023873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-772023873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 19:30:19,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~x~0_49 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:30:19,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:30:19 BasicIcfg [2019-12-07 19:30:19,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:30:19,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:30:19,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:30:19,997 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:30:19,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:27:23" (3/4) ... [2019-12-07 19:30:20,000 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:30:20,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2281~0.base_26| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26|)) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26| 1)) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~z$r_buff1_thd0~0_133 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26|) |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2281~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ULTIMATE.start_main_~#t2281~0.offset=|v_ULTIMATE.start_main_~#t2281~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2281~0.base=|v_ULTIMATE.start_main_~#t2281~0.base_26|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2283~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2281~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2281~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2283~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2282~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 19:30:20,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2282~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2282~0.base_9| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9|) |v_ULTIMATE.start_main_~#t2282~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2282~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2282~0.offset, #length] because there is no mapped edge [2019-12-07 19:30:20,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_In486572563 ~z$w_buff1_used~0_Out486572563) (= ~z$w_buff0~0_Out486572563 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In486572563| P0Thread1of1ForFork0_~arg.offset_Out486572563) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out486572563)) (= P0Thread1of1ForFork0_~arg.base_Out486572563 |P0Thread1of1ForFork0_#in~arg.base_In486572563|) (= ~z$w_buff1~0_Out486572563 ~z$w_buff0~0_In486572563) (= 1 ~z$w_buff0_used~0_Out486572563) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out486572563| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out486572563) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out486572563 256))) (not (= (mod ~z$w_buff0_used~0_Out486572563 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out486572563|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In486572563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In486572563, ~z$w_buff0~0=~z$w_buff0~0_In486572563, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In486572563|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In486572563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out486572563, ~z$w_buff0~0=~z$w_buff0~0_Out486572563, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out486572563, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out486572563, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In486572563|, ~z$w_buff1~0=~z$w_buff1~0_Out486572563, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out486572563, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out486572563|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out486572563} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 19:30:20,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2283~0.offset_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11|) |v_ULTIMATE.start_main_~#t2283~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2283~0.base_11| 0)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2283~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2283~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2283~0.offset, #length, ULTIMATE.start_main_~#t2283~0.base] because there is no mapped edge [2019-12-07 19:30:20,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-162847680 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-162847680 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-162847680| |P1Thread1of1ForFork1_#t~ite10_Out-162847680|))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-162847680| ~z~0_In-162847680)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-162847680| ~z$w_buff1~0_In-162847680) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-162847680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162847680, ~z$w_buff1~0=~z$w_buff1~0_In-162847680, ~z~0=~z~0_In-162847680} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-162847680|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-162847680, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162847680, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-162847680|, ~z$w_buff1~0=~z$w_buff1~0_In-162847680, ~z~0=~z~0_In-162847680} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 19:30:20,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2107717262 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2107717262 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2107717262| ~z$w_buff0_used~0_In-2107717262) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2107717262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2107717262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2107717262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2107717262, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2107717262|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2107717262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:30:20,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1011184323 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1011184323 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1011184323 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1011184323 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1011184323|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1011184323 |P1Thread1of1ForFork1_#t~ite12_Out1011184323|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1011184323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1011184323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1011184323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1011184323} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1011184323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1011184323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1011184323, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1011184323|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1011184323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:30:20,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In185604816 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In185604816 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out185604816| 0)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out185604816| ~z$r_buff0_thd2~0_In185604816) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In185604816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In185604816, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out185604816|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In185604816} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:30:20,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1617959878 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out-1617959878| |P2Thread1of1ForFork2_#t~ite23_Out-1617959878|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1617959878 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1617959878 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1617959878 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1617959878 256)))) (= ~z$w_buff1~0_In-1617959878 |P2Thread1of1ForFork2_#t~ite23_Out-1617959878|)) (and (not .cse0) (= ~z$w_buff1~0_In-1617959878 |P2Thread1of1ForFork2_#t~ite24_Out-1617959878|) (= |P2Thread1of1ForFork2_#t~ite23_In-1617959878| |P2Thread1of1ForFork2_#t~ite23_Out-1617959878|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1617959878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1617959878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1617959878, ~z$w_buff1~0=~z$w_buff1~0_In-1617959878, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1617959878, ~weak$$choice2~0=~weak$$choice2~0_In-1617959878} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1617959878|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1617959878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1617959878, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1617959878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1617959878, ~z$w_buff1~0=~z$w_buff1~0_In-1617959878, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1617959878, ~weak$$choice2~0=~weak$$choice2~0_In-1617959878} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 19:30:20,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-540213841 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In-540213841| |P2Thread1of1ForFork2_#t~ite26_Out-540213841|) (= |P2Thread1of1ForFork2_#t~ite27_Out-540213841| ~z$w_buff0_used~0_In-540213841) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-540213841 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-540213841 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-540213841 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-540213841 256)) .cse1))) (= ~z$w_buff0_used~0_In-540213841 |P2Thread1of1ForFork2_#t~ite26_Out-540213841|) (= |P2Thread1of1ForFork2_#t~ite27_Out-540213841| |P2Thread1of1ForFork2_#t~ite26_Out-540213841|)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-540213841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-540213841, ~weak$$choice2~0=~weak$$choice2~0_In-540213841} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-540213841|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-540213841, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-540213841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-540213841, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-540213841, ~weak$$choice2~0=~weak$$choice2~0_In-540213841, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-540213841|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 19:30:20,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1543466755 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1543466755 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1543466755 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1543466755 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1543466755|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In1543466755 |P1Thread1of1ForFork1_#t~ite14_Out1543466755|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1543466755, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1543466755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1543466755, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1543466755} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1543466755, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1543466755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1543466755, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1543466755|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1543466755} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:30:20,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite14_26| v_~z$r_buff1_thd2~0_55) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_26|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:30:20,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-598548221 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-598548221 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-598548221 256))) (= 0 (mod ~z$w_buff0_used~0_In-598548221 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-598548221 256))))) (= |P2Thread1of1ForFork2_#t~ite30_Out-598548221| |P2Thread1of1ForFork2_#t~ite29_Out-598548221|) .cse1 (= ~z$w_buff1_used~0_In-598548221 |P2Thread1of1ForFork2_#t~ite29_Out-598548221|)) (and (= ~z$w_buff1_used~0_In-598548221 |P2Thread1of1ForFork2_#t~ite30_Out-598548221|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In-598548221| |P2Thread1of1ForFork2_#t~ite29_Out-598548221|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-598548221, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-598548221, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-598548221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-598548221, ~weak$$choice2~0=~weak$$choice2~0_In-598548221, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-598548221|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-598548221|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-598548221, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-598548221, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-598548221, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-598548221, ~weak$$choice2~0=~weak$$choice2~0_In-598548221, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-598548221|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 19:30:20,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 19:30:20,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 19:30:20,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1110084360 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1110084360 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1110084360| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1110084360| ~z$w_buff0_used~0_In-1110084360)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1110084360} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1110084360|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110084360, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1110084360} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:30:20,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In749542843 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In749542843 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In749542843 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In749542843 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out749542843| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out749542843| ~z$w_buff1_used~0_In749542843)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In749542843, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In749542843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In749542843, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In749542843} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out749542843|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In749542843, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In749542843, ~z$w_buff1_used~0=~z$w_buff1_used~0_In749542843, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In749542843} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:30:20,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In141598029 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In141598029 256))) (.cse2 (= ~z$r_buff0_thd1~0_In141598029 ~z$r_buff0_thd1~0_Out141598029))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out141598029) (not .cse1)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In141598029} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In141598029, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out141598029|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out141598029} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:30:20,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In506336193 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In506336193 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In506336193 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In506336193 256)))) (or (and (= ~z$r_buff1_thd1~0_In506336193 |P0Thread1of1ForFork0_#t~ite8_Out506336193|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out506336193|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In506336193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In506336193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In506336193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In506336193, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out506336193|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In506336193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In506336193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In506336193} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:30:20,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_42|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_41|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:30:20,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1913643947 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1913643947 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite39_Out-1913643947| |P2Thread1of1ForFork2_#t~ite38_Out-1913643947|))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-1913643947| ~z$w_buff1~0_In-1913643947) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1913643947| ~z~0_In-1913643947) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1913643947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1913643947, ~z$w_buff1~0=~z$w_buff1~0_In-1913643947, ~z~0=~z~0_In-1913643947} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1913643947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1913643947, ~z$w_buff1~0=~z$w_buff1~0_In-1913643947, ~z~0=~z~0_In-1913643947, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1913643947|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1913643947|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 19:30:20,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In932769995 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In932769995 256) 0))) (or (and (= ~z$w_buff0_used~0_In932769995 |P2Thread1of1ForFork2_#t~ite40_Out932769995|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out932769995|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In932769995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In932769995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In932769995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In932769995, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out932769995|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 19:30:20,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1964528678 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1964528678 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1964528678 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1964528678 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1964528678 |P2Thread1of1ForFork2_#t~ite41_Out1964528678|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out1964528678|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964528678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1964528678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964528678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964528678} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1964528678|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1964528678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1964528678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964528678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964528678} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 19:30:20,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In162128865 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In162128865 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out162128865|)) (and (= ~z$r_buff0_thd3~0_In162128865 |P2Thread1of1ForFork2_#t~ite42_Out162128865|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In162128865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In162128865} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out162128865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In162128865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In162128865} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 19:30:20,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-531084114 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-531084114 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-531084114 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-531084114 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-531084114| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-531084114 |P2Thread1of1ForFork2_#t~ite43_Out-531084114|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-531084114, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-531084114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531084114, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-531084114} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-531084114, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-531084114, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-531084114|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531084114, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-531084114} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 19:30:20,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:30:20,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:30:20,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In2100184046 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2100184046 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out2100184046| |ULTIMATE.start_main_#t~ite48_Out2100184046|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out2100184046| ~z~0_In2100184046) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out2100184046| ~z$w_buff1~0_In2100184046) .cse0))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2100184046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2100184046, ~z$w_buff1~0=~z$w_buff1~0_In2100184046, ~z~0=~z~0_In2100184046} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2100184046, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2100184046|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2100184046, ~z$w_buff1~0=~z$w_buff1~0_In2100184046, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2100184046|, ~z~0=~z~0_In2100184046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:30:20,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In245401685 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In245401685 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out245401685| 0)) (and (= ~z$w_buff0_used~0_In245401685 |ULTIMATE.start_main_#t~ite49_Out245401685|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In245401685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In245401685} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In245401685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In245401685, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out245401685|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 19:30:20,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In2061772868 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In2061772868 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2061772868 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2061772868 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2061772868|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2061772868 |ULTIMATE.start_main_#t~ite50_Out2061772868|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2061772868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2061772868, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2061772868|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2061772868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2061772868, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2061772868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061772868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 19:30:20,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In848466720 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In848466720 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out848466720|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In848466720 |ULTIMATE.start_main_#t~ite51_Out848466720|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In848466720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In848466720} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In848466720, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out848466720|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In848466720} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 19:30:20,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-772023873 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-772023873 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-772023873 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-772023873 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-772023873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-772023873| ~z$r_buff1_thd0~0_In-772023873) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-772023873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-772023873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-772023873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-772023873} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-772023873|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-772023873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-772023873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-772023873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-772023873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 19:30:20,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~x~0_49 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:30:20,082 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_910ee94a-de86-4b03-bb6d-323d4cd58164/bin/utaipan/witness.graphml [2019-12-07 19:30:20,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:30:20,084 INFO L168 Benchmark]: Toolchain (without parser) took 177283.32 ms. Allocated memory was 1.0 GB in the beginning and 8.7 GB in the end (delta: 7.7 GB). Free memory was 937.1 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-12-07 19:30:20,084 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:30:20,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:20,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:20,085 INFO L168 Benchmark]: Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:30:20,085 INFO L168 Benchmark]: RCFGBuilder took 425.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:20,086 INFO L168 Benchmark]: TraceAbstraction took 176318.05 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.6 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-12-07 19:30:20,086 INFO L168 Benchmark]: Witness Printer took 85.23 ms. Allocated memory is still 8.7 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:30:20,088 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 425.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 176318.05 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.6 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 85.23 ms. Allocated memory is still 8.7 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 176.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6333 SDtfs, 7049 SDslu, 18838 SDs, 0 SdLazy, 8518 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 45 SyntacticMatches, 16 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292255occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 120.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 418160 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1229 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1133 ConstructedInterpolants, 0 QuantifiedInterpolants, 198019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...