./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/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 cfd582f2252b8729d8bac5c0a7eb35e5c241a027 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:38:01,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:38:01,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:38:01,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:38:01,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:38:01,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:38:01,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:38:01,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:38:01,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:38:01,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:38:01,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:38:01,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:38:01,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:38:01,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:38:01,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:38:01,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:38:01,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:38:01,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:38:01,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:38:01,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:38:01,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:38:01,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:38:01,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:38:01,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:38:01,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:38:01,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:38:01,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:38:01,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:38:01,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:38:01,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:38:01,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:38:01,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:38:01,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:38:01,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:38:01,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:38:01,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:38:01,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:38:01,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:38:01,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:38:01,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:38:01,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:38:01,782 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:38:01,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:38:01,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:38:01,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:38:01,796 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:38:01,796 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:38:01,796 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:38:01,797 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:38:01,797 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:38:01,797 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:38:01,797 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:38:01,797 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:38:01,798 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:38:01,798 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:38:01,798 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:38:01,798 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:38:01,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:38:01,799 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:38:01,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:38:01,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:38:01,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:38:01,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:38:01,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:38:01,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:38:01,800 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:38:01,800 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:38:01,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:38:01,801 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:38:01,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:38:01,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:38:01,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:38:01,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:38:01,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:38:01,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:38:01,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:38:01,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:38:01,802 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:38:01,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:38:01,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:38:01,803 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:38:01,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:38:01,803 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_37fe4cea-741c-4340-83eb-ec865ed77a40/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 -> cfd582f2252b8729d8bac5c0a7eb35e5c241a027 [2019-12-07 11:38:01,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:38:01,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:38:01,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:38:01,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:38:01,923 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:38:01,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix010_rmo.opt.i [2019-12-07 11:38:01,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/data/b2ae4c6d7/ac56d36ef33f4132ac73628d09d6db8c/FLAG6de7a7d4c [2019-12-07 11:38:02,422 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:38:02,423 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/sv-benchmarks/c/pthread-wmm/mix010_rmo.opt.i [2019-12-07 11:38:02,435 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/data/b2ae4c6d7/ac56d36ef33f4132ac73628d09d6db8c/FLAG6de7a7d4c [2019-12-07 11:38:02,949 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/data/b2ae4c6d7/ac56d36ef33f4132ac73628d09d6db8c [2019-12-07 11:38:02,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:38:02,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:38:02,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:38:02,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:38:02,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:38:02,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:38:02" (1/1) ... [2019-12-07 11:38:02,960 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 11:38:02, skipping insertion in model container [2019-12-07 11:38:02,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:38:02" (1/1) ... [2019-12-07 11:38:02,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:38:03,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:38:03,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:38:03,280 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:38:03,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:38:03,372 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:38:03,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03 WrapperNode [2019-12-07 11:38:03,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:38:03,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:38:03,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:38:03,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:38:03,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:38:03,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:38:03,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:38:03,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:38:03,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... [2019-12-07 11:38:03,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:38:03,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:38:03,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:38:03,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:38:03,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/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 11:38:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:38:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:38:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:38:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:38:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:38:03,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:38:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:38:03,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:38:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:38:03,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:38:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:38:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:38:03,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:38:03,487 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 11:38:03,894 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:38:03,895 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:38:03,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:03 BoogieIcfgContainer [2019-12-07 11:38:03,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:38:03,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:38:03,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:38:03,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:38:03,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:38:02" (1/3) ... [2019-12-07 11:38:03,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74df8835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:38:03, skipping insertion in model container [2019-12-07 11:38:03,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:38:03" (2/3) ... [2019-12-07 11:38:03,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74df8835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:38:03, skipping insertion in model container [2019-12-07 11:38:03,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:03" (3/3) ... [2019-12-07 11:38:03,900 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_rmo.opt.i [2019-12-07 11:38:03,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:38:03,906 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:38:03,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:38:03,912 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:38:03,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,940 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:38:03,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:38:03,988 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:38:03,988 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:38:03,988 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:38:03,988 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:38:03,988 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:38:03,988 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:38:03,988 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:38:03,988 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:38:03,999 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 11:38:04,000 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 11:38:04,061 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 11:38:04,062 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:38:04,073 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:38:04,096 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 11:38:04,130 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 11:38:04,131 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:38:04,138 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:38:04,163 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 11:38:04,164 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:38:07,545 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 11:38:07,926 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 11:38:08,029 INFO L206 etLargeBlockEncoding]: Checked pairs total: 138188 [2019-12-07 11:38:08,029 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 11:38:08,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 129 transitions [2019-12-07 11:38:10,827 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-07 11:38:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-07 11:38:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:38:10,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:10,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:10,833 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1166715454, now seen corresponding path program 1 times [2019-12-07 11:38:10,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:10,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597574185] [2019-12-07 11:38:10,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:10,995 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 11:38:10,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597574185] [2019-12-07 11:38:10,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:10,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:10,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11214343] [2019-12-07 11:38:11,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:11,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:11,010 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-07 11:38:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:11,373 INFO L93 Difference]: Finished difference Result 43270 states and 177632 transitions. [2019-12-07 11:38:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:11,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:38:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:11,620 INFO L225 Difference]: With dead ends: 43270 [2019-12-07 11:38:11,620 INFO L226 Difference]: Without dead ends: 40300 [2019-12-07 11:38:11,621 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 11:38:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40300 states. [2019-12-07 11:38:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40300 to 40300. [2019-12-07 11:38:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2019-12-07 11:38:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 165323 transitions. [2019-12-07 11:38:13,092 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 165323 transitions. Word has length 7 [2019-12-07 11:38:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:13,093 INFO L462 AbstractCegarLoop]: Abstraction has 40300 states and 165323 transitions. [2019-12-07 11:38:13,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 165323 transitions. [2019-12-07 11:38:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:38:13,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:13,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:13,098 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 446345132, now seen corresponding path program 1 times [2019-12-07 11:38:13,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:13,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359871069] [2019-12-07 11:38:13,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:13,167 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 11:38:13,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359871069] [2019-12-07 11:38:13,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:13,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:13,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498352898] [2019-12-07 11:38:13,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:13,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:13,169 INFO L87 Difference]: Start difference. First operand 40300 states and 165323 transitions. Second operand 4 states. [2019-12-07 11:38:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:13,753 INFO L93 Difference]: Finished difference Result 64232 states and 253053 transitions. [2019-12-07 11:38:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:13,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:38:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:14,120 INFO L225 Difference]: With dead ends: 64232 [2019-12-07 11:38:14,120 INFO L226 Difference]: Without dead ends: 64202 [2019-12-07 11:38:14,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 11:38:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64202 states. [2019-12-07 11:38:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64202 to 62556. [2019-12-07 11:38:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62556 states. [2019-12-07 11:38:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 247863 transitions. [2019-12-07 11:38:15,888 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 247863 transitions. Word has length 13 [2019-12-07 11:38:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:15,889 INFO L462 AbstractCegarLoop]: Abstraction has 62556 states and 247863 transitions. [2019-12-07 11:38:15,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 247863 transitions. [2019-12-07 11:38:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:38:15,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:15,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:15,895 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:15,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1030418596, now seen corresponding path program 1 times [2019-12-07 11:38:15,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:15,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521054893] [2019-12-07 11:38:15,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:15,956 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 11:38:15,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521054893] [2019-12-07 11:38:15,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:15,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:15,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456491391] [2019-12-07 11:38:15,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:15,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:15,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:15,958 INFO L87 Difference]: Start difference. First operand 62556 states and 247863 transitions. Second operand 4 states. [2019-12-07 11:38:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:16,590 INFO L93 Difference]: Finished difference Result 80364 states and 313729 transitions. [2019-12-07 11:38:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:38:16,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:38:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:16,774 INFO L225 Difference]: With dead ends: 80364 [2019-12-07 11:38:16,774 INFO L226 Difference]: Without dead ends: 80336 [2019-12-07 11:38:16,775 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 11:38:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80336 states. [2019-12-07 11:38:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80336 to 71524. [2019-12-07 11:38:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71524 states. [2019-12-07 11:38:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71524 states to 71524 states and 281953 transitions. [2019-12-07 11:38:19,778 INFO L78 Accepts]: Start accepts. Automaton has 71524 states and 281953 transitions. Word has length 16 [2019-12-07 11:38:19,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:19,778 INFO L462 AbstractCegarLoop]: Abstraction has 71524 states and 281953 transitions. [2019-12-07 11:38:19,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:19,778 INFO L276 IsEmpty]: Start isEmpty. Operand 71524 states and 281953 transitions. [2019-12-07 11:38:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:38:19,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:19,784 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 11:38:19,784 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash -239561606, now seen corresponding path program 1 times [2019-12-07 11:38:19,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:19,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311236213] [2019-12-07 11:38:19,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:38:19,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311236213] [2019-12-07 11:38:19,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:19,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:19,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432838686] [2019-12-07 11:38:19,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:19,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:19,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:19,827 INFO L87 Difference]: Start difference. First operand 71524 states and 281953 transitions. Second operand 3 states. [2019-12-07 11:38:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:20,089 INFO L93 Difference]: Finished difference Result 71524 states and 278893 transitions. [2019-12-07 11:38:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:20,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:38:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:20,251 INFO L225 Difference]: With dead ends: 71524 [2019-12-07 11:38:20,251 INFO L226 Difference]: Without dead ends: 71524 [2019-12-07 11:38:20,251 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 11:38:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71524 states. [2019-12-07 11:38:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71524 to 71316. [2019-12-07 11:38:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71316 states. [2019-12-07 11:38:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71316 states to 71316 states and 278233 transitions. [2019-12-07 11:38:22,137 INFO L78 Accepts]: Start accepts. Automaton has 71316 states and 278233 transitions. Word has length 18 [2019-12-07 11:38:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:22,137 INFO L462 AbstractCegarLoop]: Abstraction has 71316 states and 278233 transitions. [2019-12-07 11:38:22,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 71316 states and 278233 transitions. [2019-12-07 11:38:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:38:22,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:22,142 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 11:38:22,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash 419417230, now seen corresponding path program 1 times [2019-12-07 11:38:22,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:22,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793515372] [2019-12-07 11:38:22,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:22,195 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 11:38:22,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793515372] [2019-12-07 11:38:22,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:22,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:38:22,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473545620] [2019-12-07 11:38:22,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:38:22,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:38:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:38:22,197 INFO L87 Difference]: Start difference. First operand 71316 states and 278233 transitions. Second operand 3 states. [2019-12-07 11:38:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:22,515 INFO L93 Difference]: Finished difference Result 71336 states and 278133 transitions. [2019-12-07 11:38:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:22,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:38:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:22,929 INFO L225 Difference]: With dead ends: 71336 [2019-12-07 11:38:22,929 INFO L226 Difference]: Without dead ends: 71336 [2019-12-07 11:38:22,929 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 11:38:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71336 states. [2019-12-07 11:38:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71336 to 71251. [2019-12-07 11:38:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71251 states. [2019-12-07 11:38:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71251 states to 71251 states and 277954 transitions. [2019-12-07 11:38:24,665 INFO L78 Accepts]: Start accepts. Automaton has 71251 states and 277954 transitions. Word has length 18 [2019-12-07 11:38:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:24,666 INFO L462 AbstractCegarLoop]: Abstraction has 71251 states and 277954 transitions. [2019-12-07 11:38:24,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:38:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 71251 states and 277954 transitions. [2019-12-07 11:38:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:38:24,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:24,672 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 11:38:24,672 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash -87585687, now seen corresponding path program 1 times [2019-12-07 11:38:24,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:24,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144620743] [2019-12-07 11:38:24,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:24,723 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 11:38:24,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144620743] [2019-12-07 11:38:24,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:24,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:24,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306738493] [2019-12-07 11:38:24,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:24,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:24,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:24,725 INFO L87 Difference]: Start difference. First operand 71251 states and 277954 transitions. Second operand 4 states. [2019-12-07 11:38:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:25,131 INFO L93 Difference]: Finished difference Result 66904 states and 260443 transitions. [2019-12-07 11:38:25,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:25,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:38:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:25,269 INFO L225 Difference]: With dead ends: 66904 [2019-12-07 11:38:25,269 INFO L226 Difference]: Without dead ends: 66904 [2019-12-07 11:38:25,269 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 11:38:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66904 states. [2019-12-07 11:38:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66904 to 66904. [2019-12-07 11:38:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66904 states. [2019-12-07 11:38:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66904 states to 66904 states and 260443 transitions. [2019-12-07 11:38:26,925 INFO L78 Accepts]: Start accepts. Automaton has 66904 states and 260443 transitions. Word has length 19 [2019-12-07 11:38:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:26,926 INFO L462 AbstractCegarLoop]: Abstraction has 66904 states and 260443 transitions. [2019-12-07 11:38:26,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 66904 states and 260443 transitions. [2019-12-07 11:38:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:38:26,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:26,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:26,938 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 81142022, now seen corresponding path program 1 times [2019-12-07 11:38:26,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:26,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634871184] [2019-12-07 11:38:26,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:26,986 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 11:38:26,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634871184] [2019-12-07 11:38:26,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:26,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:26,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232407767] [2019-12-07 11:38:26,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:38:26,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:38:26,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:26,988 INFO L87 Difference]: Start difference. First operand 66904 states and 260443 transitions. Second operand 5 states. [2019-12-07 11:38:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:27,664 INFO L93 Difference]: Finished difference Result 80160 states and 308169 transitions. [2019-12-07 11:38:27,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:38:27,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:38:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:27,825 INFO L225 Difference]: With dead ends: 80160 [2019-12-07 11:38:27,825 INFO L226 Difference]: Without dead ends: 80108 [2019-12-07 11:38:27,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 11:38:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80108 states. [2019-12-07 11:38:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80108 to 66540. [2019-12-07 11:38:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66540 states. [2019-12-07 11:38:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66540 states to 66540 states and 259135 transitions. [2019-12-07 11:38:29,760 INFO L78 Accepts]: Start accepts. Automaton has 66540 states and 259135 transitions. Word has length 22 [2019-12-07 11:38:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:29,761 INFO L462 AbstractCegarLoop]: Abstraction has 66540 states and 259135 transitions. [2019-12-07 11:38:29,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:38:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 66540 states and 259135 transitions. [2019-12-07 11:38:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:38:29,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:29,824 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 11:38:29,825 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:29,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash -70807778, now seen corresponding path program 1 times [2019-12-07 11:38:29,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:29,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825160458] [2019-12-07 11:38:29,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:29,884 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 11:38:29,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825160458] [2019-12-07 11:38:29,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:29,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:38:29,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491291682] [2019-12-07 11:38:29,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:38:29,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:29,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:38:29,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:38:29,885 INFO L87 Difference]: Start difference. First operand 66540 states and 259135 transitions. Second operand 4 states. [2019-12-07 11:38:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:30,127 INFO L93 Difference]: Finished difference Result 66488 states and 258955 transitions. [2019-12-07 11:38:30,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:38:30,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 11:38:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:30,270 INFO L225 Difference]: With dead ends: 66488 [2019-12-07 11:38:30,270 INFO L226 Difference]: Without dead ends: 66488 [2019-12-07 11:38:30,270 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 11:38:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66488 states. [2019-12-07 11:38:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66488 to 66488. [2019-12-07 11:38:31,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66488 states. [2019-12-07 11:38:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66488 states to 66488 states and 258955 transitions. [2019-12-07 11:38:32,096 INFO L78 Accepts]: Start accepts. Automaton has 66488 states and 258955 transitions. Word has length 33 [2019-12-07 11:38:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:32,096 INFO L462 AbstractCegarLoop]: Abstraction has 66488 states and 258955 transitions. [2019-12-07 11:38:32,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:38:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 66488 states and 258955 transitions. [2019-12-07 11:38:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:32,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:32,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:32,159 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1087019625, now seen corresponding path program 1 times [2019-12-07 11:38:32,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:32,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031053692] [2019-12-07 11:38:32,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:32,228 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 11:38:32,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031053692] [2019-12-07 11:38:32,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:32,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:38:32,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282218070] [2019-12-07 11:38:32,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:38:32,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:32,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:38:32,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:38:32,229 INFO L87 Difference]: Start difference. First operand 66488 states and 258955 transitions. Second operand 5 states. [2019-12-07 11:38:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:32,689 INFO L93 Difference]: Finished difference Result 92690 states and 366351 transitions. [2019-12-07 11:38:32,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:38:32,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 11:38:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:32,889 INFO L225 Difference]: With dead ends: 92690 [2019-12-07 11:38:32,889 INFO L226 Difference]: Without dead ends: 92690 [2019-12-07 11:38:32,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:38:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92690 states. [2019-12-07 11:38:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92690 to 90168. [2019-12-07 11:38:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90168 states. [2019-12-07 11:38:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90168 states to 90168 states and 357275 transitions. [2019-12-07 11:38:35,111 INFO L78 Accepts]: Start accepts. Automaton has 90168 states and 357275 transitions. Word has length 34 [2019-12-07 11:38:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:35,111 INFO L462 AbstractCegarLoop]: Abstraction has 90168 states and 357275 transitions. [2019-12-07 11:38:35,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:38:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 90168 states and 357275 transitions. [2019-12-07 11:38:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:35,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:35,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:35,451 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2074469443, now seen corresponding path program 2 times [2019-12-07 11:38:35,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:35,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831378140] [2019-12-07 11:38:35,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:35,578 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 11:38:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831378140] [2019-12-07 11:38:35,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:35,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:38:35,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878837386] [2019-12-07 11:38:35,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:38:35,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:38:35,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:38:35,579 INFO L87 Difference]: Start difference. First operand 90168 states and 357275 transitions. Second operand 8 states. [2019-12-07 11:38:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:36,591 INFO L93 Difference]: Finished difference Result 141420 states and 558196 transitions. [2019-12-07 11:38:36,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:38:36,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 11:38:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:36,921 INFO L225 Difference]: With dead ends: 141420 [2019-12-07 11:38:36,921 INFO L226 Difference]: Without dead ends: 141420 [2019-12-07 11:38:36,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:38:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141420 states. [2019-12-07 11:38:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141420 to 108286. [2019-12-07 11:38:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108286 states. [2019-12-07 11:38:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108286 states to 108286 states and 427816 transitions. [2019-12-07 11:38:40,277 INFO L78 Accepts]: Start accepts. Automaton has 108286 states and 427816 transitions. Word has length 34 [2019-12-07 11:38:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:40,277 INFO L462 AbstractCegarLoop]: Abstraction has 108286 states and 427816 transitions. [2019-12-07 11:38:40,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:38:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 108286 states and 427816 transitions. [2019-12-07 11:38:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:40,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:40,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:40,376 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1895308249, now seen corresponding path program 3 times [2019-12-07 11:38:40,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:40,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129328790] [2019-12-07 11:38:40,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:40,440 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 11:38:40,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129328790] [2019-12-07 11:38:40,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:40,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:38:40,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378848938] [2019-12-07 11:38:40,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:38:40,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:40,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:38:40,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:38:40,441 INFO L87 Difference]: Start difference. First operand 108286 states and 427816 transitions. Second operand 6 states. [2019-12-07 11:38:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:40,979 INFO L93 Difference]: Finished difference Result 136718 states and 539796 transitions. [2019-12-07 11:38:40,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:38:40,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 11:38:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:41,274 INFO L225 Difference]: With dead ends: 136718 [2019-12-07 11:38:41,274 INFO L226 Difference]: Without dead ends: 122110 [2019-12-07 11:38:41,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:38:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122110 states. [2019-12-07 11:38:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122110 to 122110. [2019-12-07 11:38:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122110 states. [2019-12-07 11:38:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122110 states to 122110 states and 484064 transitions. [2019-12-07 11:38:46,391 INFO L78 Accepts]: Start accepts. Automaton has 122110 states and 484064 transitions. Word has length 34 [2019-12-07 11:38:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:46,392 INFO L462 AbstractCegarLoop]: Abstraction has 122110 states and 484064 transitions. [2019-12-07 11:38:46,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:38:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 122110 states and 484064 transitions. [2019-12-07 11:38:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:46,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:46,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:46,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash -977505411, now seen corresponding path program 4 times [2019-12-07 11:38:46,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:46,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444525078] [2019-12-07 11:38:46,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:46,633 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 11:38:46,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444525078] [2019-12-07 11:38:46,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:46,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:38:46,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278375131] [2019-12-07 11:38:46,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:38:46,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:38:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:38:46,635 INFO L87 Difference]: Start difference. First operand 122110 states and 484064 transitions. Second operand 9 states. [2019-12-07 11:38:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:47,784 INFO L93 Difference]: Finished difference Result 209461 states and 816961 transitions. [2019-12-07 11:38:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:38:47,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 11:38:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:48,224 INFO L225 Difference]: With dead ends: 209461 [2019-12-07 11:38:48,224 INFO L226 Difference]: Without dead ends: 191711 [2019-12-07 11:38:48,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:38:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191711 states. [2019-12-07 11:38:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191711 to 104688. [2019-12-07 11:38:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104688 states. [2019-12-07 11:38:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104688 states to 104688 states and 412945 transitions. [2019-12-07 11:38:51,929 INFO L78 Accepts]: Start accepts. Automaton has 104688 states and 412945 transitions. Word has length 34 [2019-12-07 11:38:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:51,930 INFO L462 AbstractCegarLoop]: Abstraction has 104688 states and 412945 transitions. [2019-12-07 11:38:51,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:38:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 104688 states and 412945 transitions. [2019-12-07 11:38:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:52,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:52,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:52,030 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2084608253, now seen corresponding path program 5 times [2019-12-07 11:38:52,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:52,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284762895] [2019-12-07 11:38:52,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:52,161 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 11:38:52,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284762895] [2019-12-07 11:38:52,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:52,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:38:52,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443914882] [2019-12-07 11:38:52,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:38:52,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:38:52,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:38:52,162 INFO L87 Difference]: Start difference. First operand 104688 states and 412945 transitions. Second operand 9 states. [2019-12-07 11:38:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:53,152 INFO L93 Difference]: Finished difference Result 151338 states and 602036 transitions. [2019-12-07 11:38:53,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:38:53,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 11:38:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:53,495 INFO L225 Difference]: With dead ends: 151338 [2019-12-07 11:38:53,495 INFO L226 Difference]: Without dead ends: 144874 [2019-12-07 11:38:53,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:38:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144874 states. [2019-12-07 11:38:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144874 to 105494. [2019-12-07 11:38:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105494 states. [2019-12-07 11:38:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105494 states to 105494 states and 416276 transitions. [2019-12-07 11:38:56,646 INFO L78 Accepts]: Start accepts. Automaton has 105494 states and 416276 transitions. Word has length 34 [2019-12-07 11:38:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:38:56,646 INFO L462 AbstractCegarLoop]: Abstraction has 105494 states and 416276 transitions. [2019-12-07 11:38:56,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:38:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 105494 states and 416276 transitions. [2019-12-07 11:38:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:38:56,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:38:56,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:38:56,752 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:38:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:38:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash -779254563, now seen corresponding path program 6 times [2019-12-07 11:38:56,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:38:56,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938984674] [2019-12-07 11:38:56,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:38:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:38:56,812 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 11:38:56,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938984674] [2019-12-07 11:38:56,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:38:56,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:38:56,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802785415] [2019-12-07 11:38:56,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:38:56,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:38:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:38:56,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:38:56,813 INFO L87 Difference]: Start difference. First operand 105494 states and 416276 transitions. Second operand 7 states. [2019-12-07 11:38:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:38:57,817 INFO L93 Difference]: Finished difference Result 174832 states and 689418 transitions. [2019-12-07 11:38:57,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:38:57,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 11:38:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:38:58,215 INFO L225 Difference]: With dead ends: 174832 [2019-12-07 11:38:58,216 INFO L226 Difference]: Without dead ends: 174832 [2019-12-07 11:38:58,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:38:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174832 states. [2019-12-07 11:39:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174832 to 140164. [2019-12-07 11:39:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140164 states. [2019-12-07 11:39:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140164 states to 140164 states and 553421 transitions. [2019-12-07 11:39:04,442 INFO L78 Accepts]: Start accepts. Automaton has 140164 states and 553421 transitions. Word has length 34 [2019-12-07 11:39:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:04,443 INFO L462 AbstractCegarLoop]: Abstraction has 140164 states and 553421 transitions. [2019-12-07 11:39:04,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:39:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 140164 states and 553421 transitions. [2019-12-07 11:39:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:39:04,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:04,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:04,583 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash 667624249, now seen corresponding path program 7 times [2019-12-07 11:39:04,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:04,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447681143] [2019-12-07 11:39:04,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:04,623 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 11:39:04,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447681143] [2019-12-07 11:39:04,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:04,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:39:04,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206992531] [2019-12-07 11:39:04,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:39:04,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:39:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:39:04,625 INFO L87 Difference]: Start difference. First operand 140164 states and 553421 transitions. Second operand 4 states. [2019-12-07 11:39:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:04,897 INFO L93 Difference]: Finished difference Result 80582 states and 278761 transitions. [2019-12-07 11:39:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:39:04,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 11:39:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:05,033 INFO L225 Difference]: With dead ends: 80582 [2019-12-07 11:39:05,033 INFO L226 Difference]: Without dead ends: 74594 [2019-12-07 11:39:05,034 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 11:39:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74594 states. [2019-12-07 11:39:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74594 to 74594. [2019-12-07 11:39:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74594 states. [2019-12-07 11:39:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74594 states to 74594 states and 257393 transitions. [2019-12-07 11:39:06,519 INFO L78 Accepts]: Start accepts. Automaton has 74594 states and 257393 transitions. Word has length 34 [2019-12-07 11:39:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:06,519 INFO L462 AbstractCegarLoop]: Abstraction has 74594 states and 257393 transitions. [2019-12-07 11:39:06,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:39:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 74594 states and 257393 transitions. [2019-12-07 11:39:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:39:06,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:06,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:06,590 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash 15625802, now seen corresponding path program 1 times [2019-12-07 11:39:06,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:06,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132164603] [2019-12-07 11:39:06,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:06,634 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 11:39:06,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132164603] [2019-12-07 11:39:06,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:06,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:39:06,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534376271] [2019-12-07 11:39:06,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:39:06,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:06,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:39:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:39:06,635 INFO L87 Difference]: Start difference. First operand 74594 states and 257393 transitions. Second operand 5 states. [2019-12-07 11:39:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:06,686 INFO L93 Difference]: Finished difference Result 10691 states and 33179 transitions. [2019-12-07 11:39:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:39:06,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 11:39:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:06,694 INFO L225 Difference]: With dead ends: 10691 [2019-12-07 11:39:06,695 INFO L226 Difference]: Without dead ends: 7573 [2019-12-07 11:39:06,695 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 11:39:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-07 11:39:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-07 11:39:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-07 11:39:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 22153 transitions. [2019-12-07 11:39:06,779 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 22153 transitions. Word has length 35 [2019-12-07 11:39:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:06,780 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 22153 transitions. [2019-12-07 11:39:06,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:39:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 22153 transitions. [2019-12-07 11:39:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 11:39:06,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:06,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:06,786 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1481374704, now seen corresponding path program 1 times [2019-12-07 11:39:06,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:06,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842887994] [2019-12-07 11:39:06,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:06,837 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 11:39:06,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842887994] [2019-12-07 11:39:06,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:06,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:39:06,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470710634] [2019-12-07 11:39:06,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:39:06,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:39:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:39:06,838 INFO L87 Difference]: Start difference. First operand 7573 states and 22153 transitions. Second operand 6 states. [2019-12-07 11:39:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:06,892 INFO L93 Difference]: Finished difference Result 6235 states and 19080 transitions. [2019-12-07 11:39:06,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:39:06,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 11:39:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:06,899 INFO L225 Difference]: With dead ends: 6235 [2019-12-07 11:39:06,899 INFO L226 Difference]: Without dead ends: 6108 [2019-12-07 11:39:06,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:39:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6108 states. [2019-12-07 11:39:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6108 to 6084. [2019-12-07 11:39:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6084 states. [2019-12-07 11:39:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6084 states to 6084 states and 18741 transitions. [2019-12-07 11:39:06,969 INFO L78 Accepts]: Start accepts. Automaton has 6084 states and 18741 transitions. Word has length 47 [2019-12-07 11:39:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:06,969 INFO L462 AbstractCegarLoop]: Abstraction has 6084 states and 18741 transitions. [2019-12-07 11:39:06,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:39:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6084 states and 18741 transitions. [2019-12-07 11:39:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:06,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:06,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:06,974 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 940435109, now seen corresponding path program 1 times [2019-12-07 11:39:06,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:06,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416378083] [2019-12-07 11:39:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:07,028 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 11:39:07,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416378083] [2019-12-07 11:39:07,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:07,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:39:07,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896769953] [2019-12-07 11:39:07,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:39:07,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:39:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:39:07,030 INFO L87 Difference]: Start difference. First operand 6084 states and 18741 transitions. Second operand 6 states. [2019-12-07 11:39:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:07,158 INFO L93 Difference]: Finished difference Result 10615 states and 32432 transitions. [2019-12-07 11:39:07,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:39:07,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:39:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:07,169 INFO L225 Difference]: With dead ends: 10615 [2019-12-07 11:39:07,169 INFO L226 Difference]: Without dead ends: 9488 [2019-12-07 11:39:07,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:39:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9488 states. [2019-12-07 11:39:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9488 to 6998. [2019-12-07 11:39:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6998 states. [2019-12-07 11:39:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 21448 transitions. [2019-12-07 11:39:07,335 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 21448 transitions. Word has length 62 [2019-12-07 11:39:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:07,335 INFO L462 AbstractCegarLoop]: Abstraction has 6998 states and 21448 transitions. [2019-12-07 11:39:07,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:39:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 21448 transitions. [2019-12-07 11:39:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:07,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:07,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:07,342 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:07,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1909825061, now seen corresponding path program 2 times [2019-12-07 11:39:07,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:07,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362219519] [2019-12-07 11:39:07,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:07,479 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 11:39:07,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362219519] [2019-12-07 11:39:07,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:07,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:39:07,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791756593] [2019-12-07 11:39:07,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:39:07,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:39:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:39:07,480 INFO L87 Difference]: Start difference. First operand 6998 states and 21448 transitions. Second operand 10 states. [2019-12-07 11:39:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:08,632 INFO L93 Difference]: Finished difference Result 24610 states and 71897 transitions. [2019-12-07 11:39:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:39:08,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 11:39:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:08,662 INFO L225 Difference]: With dead ends: 24610 [2019-12-07 11:39:08,663 INFO L226 Difference]: Without dead ends: 24425 [2019-12-07 11:39:08,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:39:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24425 states. [2019-12-07 11:39:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24425 to 14374. [2019-12-07 11:39:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14374 states. [2019-12-07 11:39:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14374 states to 14374 states and 44718 transitions. [2019-12-07 11:39:08,931 INFO L78 Accepts]: Start accepts. Automaton has 14374 states and 44718 transitions. Word has length 62 [2019-12-07 11:39:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:08,931 INFO L462 AbstractCegarLoop]: Abstraction has 14374 states and 44718 transitions. [2019-12-07 11:39:08,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:39:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14374 states and 44718 transitions. [2019-12-07 11:39:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:08,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:08,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:08,946 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1506410157, now seen corresponding path program 3 times [2019-12-07 11:39:08,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:08,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839323355] [2019-12-07 11:39:08,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:09,161 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 11:39:09,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839323355] [2019-12-07 11:39:09,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:09,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:39:09,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2749409] [2019-12-07 11:39:09,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:39:09,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:39:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:39:09,162 INFO L87 Difference]: Start difference. First operand 14374 states and 44718 transitions. Second operand 10 states. [2019-12-07 11:39:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:09,827 INFO L93 Difference]: Finished difference Result 22953 states and 67106 transitions. [2019-12-07 11:39:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:39:09,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 11:39:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:09,851 INFO L225 Difference]: With dead ends: 22953 [2019-12-07 11:39:09,851 INFO L226 Difference]: Without dead ends: 21984 [2019-12-07 11:39:09,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:39:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21984 states. [2019-12-07 11:39:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21984 to 17610. [2019-12-07 11:39:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17610 states. [2019-12-07 11:39:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17610 states to 17610 states and 52876 transitions. [2019-12-07 11:39:10,100 INFO L78 Accepts]: Start accepts. Automaton has 17610 states and 52876 transitions. Word has length 62 [2019-12-07 11:39:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:10,100 INFO L462 AbstractCegarLoop]: Abstraction has 17610 states and 52876 transitions. [2019-12-07 11:39:10,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:39:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17610 states and 52876 transitions. [2019-12-07 11:39:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:10,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:10,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:10,117 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1807325087, now seen corresponding path program 4 times [2019-12-07 11:39:10,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:10,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523858422] [2019-12-07 11:39:10,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:10,307 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 11:39:10,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523858422] [2019-12-07 11:39:10,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:10,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:39:10,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178501993] [2019-12-07 11:39:10,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:39:10,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:39:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:39:10,308 INFO L87 Difference]: Start difference. First operand 17610 states and 52876 transitions. Second operand 9 states. [2019-12-07 11:39:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:10,967 INFO L93 Difference]: Finished difference Result 27881 states and 79698 transitions. [2019-12-07 11:39:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:39:10,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 11:39:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:10,998 INFO L225 Difference]: With dead ends: 27881 [2019-12-07 11:39:10,998 INFO L226 Difference]: Without dead ends: 27267 [2019-12-07 11:39:10,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:39:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27267 states. [2019-12-07 11:39:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27267 to 22091. [2019-12-07 11:39:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22091 states. [2019-12-07 11:39:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22091 states to 22091 states and 65033 transitions. [2019-12-07 11:39:11,318 INFO L78 Accepts]: Start accepts. Automaton has 22091 states and 65033 transitions. Word has length 62 [2019-12-07 11:39:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:11,318 INFO L462 AbstractCegarLoop]: Abstraction has 22091 states and 65033 transitions. [2019-12-07 11:39:11,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:39:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22091 states and 65033 transitions. [2019-12-07 11:39:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:11,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:11,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:11,340 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1909507219, now seen corresponding path program 5 times [2019-12-07 11:39:11,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:11,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046549516] [2019-12-07 11:39:11,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:11,380 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 11:39:11,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046549516] [2019-12-07 11:39:11,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:11,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:39:11,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726418696] [2019-12-07 11:39:11,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:39:11,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:39:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:39:11,382 INFO L87 Difference]: Start difference. First operand 22091 states and 65033 transitions. Second operand 4 states. [2019-12-07 11:39:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:11,570 INFO L93 Difference]: Finished difference Result 21040 states and 61445 transitions. [2019-12-07 11:39:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:39:11,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:39:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:11,592 INFO L225 Difference]: With dead ends: 21040 [2019-12-07 11:39:11,592 INFO L226 Difference]: Without dead ends: 21040 [2019-12-07 11:39:11,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 11:39:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-07 11:39:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 19888. [2019-12-07 11:39:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19888 states. [2019-12-07 11:39:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19888 states to 19888 states and 58005 transitions. [2019-12-07 11:39:11,826 INFO L78 Accepts]: Start accepts. Automaton has 19888 states and 58005 transitions. Word has length 62 [2019-12-07 11:39:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:11,827 INFO L462 AbstractCegarLoop]: Abstraction has 19888 states and 58005 transitions. [2019-12-07 11:39:11,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:39:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 19888 states and 58005 transitions. [2019-12-07 11:39:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:11,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:11,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:11,844 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1032195739, now seen corresponding path program 6 times [2019-12-07 11:39:11,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:11,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517332514] [2019-12-07 11:39:11,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:11,986 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 11:39:11,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517332514] [2019-12-07 11:39:11,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:11,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:39:11,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120977437] [2019-12-07 11:39:11,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:39:11,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:39:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:39:11,987 INFO L87 Difference]: Start difference. First operand 19888 states and 58005 transitions. Second operand 10 states. [2019-12-07 11:39:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:14,780 INFO L93 Difference]: Finished difference Result 33536 states and 93195 transitions. [2019-12-07 11:39:14,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:39:14,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 11:39:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:14,835 INFO L225 Difference]: With dead ends: 33536 [2019-12-07 11:39:14,836 INFO L226 Difference]: Without dead ends: 32783 [2019-12-07 11:39:14,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:39:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32783 states. [2019-12-07 11:39:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32783 to 15848. [2019-12-07 11:39:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-12-07 11:39:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 46779 transitions. [2019-12-07 11:39:15,156 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 46779 transitions. Word has length 62 [2019-12-07 11:39:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:15,156 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 46779 transitions. [2019-12-07 11:39:15,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:39:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 46779 transitions. [2019-12-07 11:39:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:39:15,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:15,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:15,171 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 409978591, now seen corresponding path program 7 times [2019-12-07 11:39:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:15,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877457662] [2019-12-07 11:39:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:15,225 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 11:39:15,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877457662] [2019-12-07 11:39:15,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:15,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:39:15,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628282222] [2019-12-07 11:39:15,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:39:15,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:39:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:39:15,227 INFO L87 Difference]: Start difference. First operand 15848 states and 46779 transitions. Second operand 4 states. [2019-12-07 11:39:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:15,298 INFO L93 Difference]: Finished difference Result 17037 states and 49535 transitions. [2019-12-07 11:39:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:39:15,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:39:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:15,313 INFO L225 Difference]: With dead ends: 17037 [2019-12-07 11:39:15,313 INFO L226 Difference]: Without dead ends: 12825 [2019-12-07 11:39:15,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:39:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12825 states. [2019-12-07 11:39:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12825 to 9729. [2019-12-07 11:39:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9729 states. [2019-12-07 11:39:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9729 states to 9729 states and 29160 transitions. [2019-12-07 11:39:15,449 INFO L78 Accepts]: Start accepts. Automaton has 9729 states and 29160 transitions. Word has length 62 [2019-12-07 11:39:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:15,449 INFO L462 AbstractCegarLoop]: Abstraction has 9729 states and 29160 transitions. [2019-12-07 11:39:15,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:39:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9729 states and 29160 transitions. [2019-12-07 11:39:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:39:15,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:15,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:15,458 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:15,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1412163332, now seen corresponding path program 1 times [2019-12-07 11:39:15,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:15,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138164206] [2019-12-07 11:39:15,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:39:15,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138164206] [2019-12-07 11:39:15,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:15,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:39:15,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646129970] [2019-12-07 11:39:15,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:39:15,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:39:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:39:15,599 INFO L87 Difference]: Start difference. First operand 9729 states and 29160 transitions. Second operand 11 states. [2019-12-07 11:39:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:17,830 INFO L93 Difference]: Finished difference Result 17302 states and 48439 transitions. [2019-12-07 11:39:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:39:17,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-12-07 11:39:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:17,835 INFO L225 Difference]: With dead ends: 17302 [2019-12-07 11:39:17,835 INFO L226 Difference]: Without dead ends: 5929 [2019-12-07 11:39:17,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:39:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states. [2019-12-07 11:39:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 3076. [2019-12-07 11:39:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-12-07 11:39:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 7630 transitions. [2019-12-07 11:39:17,877 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 7630 transitions. Word has length 63 [2019-12-07 11:39:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:17,877 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 7630 transitions. [2019-12-07 11:39:17,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:39:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 7630 transitions. [2019-12-07 11:39:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:39:17,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:17,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:17,879 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 742159584, now seen corresponding path program 2 times [2019-12-07 11:39:17,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:17,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760529731] [2019-12-07 11:39:17,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:17,957 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 11:39:17,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760529731] [2019-12-07 11:39:17,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:17,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:39:17,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990819586] [2019-12-07 11:39:17,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:39:17,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:39:17,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:39:17,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:39:17,958 INFO L87 Difference]: Start difference. First operand 3076 states and 7630 transitions. Second operand 8 states. [2019-12-07 11:39:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:39:18,195 INFO L93 Difference]: Finished difference Result 6839 states and 16680 transitions. [2019-12-07 11:39:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:39:18,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 11:39:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:39:18,200 INFO L225 Difference]: With dead ends: 6839 [2019-12-07 11:39:18,200 INFO L226 Difference]: Without dead ends: 6011 [2019-12-07 11:39:18,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:39:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2019-12-07 11:39:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 4903. [2019-12-07 11:39:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2019-12-07 11:39:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 12366 transitions. [2019-12-07 11:39:18,254 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 12366 transitions. Word has length 63 [2019-12-07 11:39:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:39:18,254 INFO L462 AbstractCegarLoop]: Abstraction has 4903 states and 12366 transitions. [2019-12-07 11:39:18,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:39:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 12366 transitions. [2019-12-07 11:39:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:39:18,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:39:18,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:39:18,257 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:39:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:39:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash -250797522, now seen corresponding path program 3 times [2019-12-07 11:39:18,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:39:18,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348756780] [2019-12-07 11:39:18,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:39:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:39:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:39:18,348 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:39:18,348 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:39:18,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_119|) |v_ULTIMATE.start_main_~#t272~0.offset_66| 0)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t272~0.base_119| 4)) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t272~0.base_119|) 0) (= 0 |v_ULTIMATE.start_main_~#t272~0.offset_66|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t272~0.base_119| 1) |v_#valid_150|) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t272~0.base_119|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ULTIMATE.start_main_~#t272~0.base=|v_ULTIMATE.start_main_~#t272~0.base_119|, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_39|, ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_~#t272~0.offset=|v_ULTIMATE.start_main_~#t272~0.offset_66|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t273~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t273~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t272~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t274~0.offset, ULTIMATE.start_main_~#t274~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t272~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:39:18,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t273~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t273~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t273~0.base_11| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t273~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11|) |v_ULTIMATE.start_main_~#t273~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t273~0.offset, #length, ULTIMATE.start_main_~#t273~0.base] because there is no mapped edge [2019-12-07 11:39:18,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t274~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t274~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t274~0.offset_8|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) |v_ULTIMATE.start_main_~#t274~0.offset_8| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t274~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t274~0.offset] because there is no mapped edge [2019-12-07 11:39:18,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:39:18,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In600474959 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In600474959 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In600474959 |P2Thread1of1ForFork0_#t~ite28_Out600474959|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff1~0_In600474959 |P2Thread1of1ForFork0_#t~ite28_Out600474959|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In600474959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959, ~z$w_buff1~0=~z$w_buff1~0_In600474959} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out600474959|, ~z$w_buff0~0=~z$w_buff0~0_In600474959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959, ~z$w_buff1~0=~z$w_buff1~0_In600474959} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:39:18,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:39:18,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:39:18,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1985662672 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out1985662672| ~z~0_In1985662672)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out1985662672| ~z$mem_tmp~0_In1985662672) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1985662672, ~z$flush_delayed~0=~z$flush_delayed~0_In1985662672, ~z~0=~z~0_In1985662672} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1985662672|, ~z$mem_tmp~0=~z$mem_tmp~0_In1985662672, ~z$flush_delayed~0=~z$flush_delayed~0_In1985662672, ~z~0=~z~0_In1985662672} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:39:18,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:39:18,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1605106035 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1605106035 256)))) (or (and (= ~z$w_buff0_used~0_In1605106035 |P2Thread1of1ForFork0_#t~ite51_Out1605106035|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1605106035|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1605106035|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:39:18,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1693622312 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1693622312 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1693622312 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1693622312 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| ~z$w_buff1_used~0_In-1693622312)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1693622312|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:39:18,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1318378344 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-1318378344 ~z$r_buff0_thd3~0_Out-1318378344)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1318378344 256) 0))) (or (and (= ~z$r_buff0_thd3~0_Out-1318378344 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1318378344} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1318378344, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1318378344|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:39:18,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In900272780 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In900272780 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In900272780 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In900272780 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite54_Out900272780| ~z$r_buff1_thd3~0_In900272780) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out900272780| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In900272780, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900272780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900272780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900272780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In900272780, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out900272780|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900272780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900272780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900272780} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:39:18,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:39:18,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1453409856 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-1453409856| ~z$mem_tmp~0_In-1453409856)) (and (= ~z~0_In-1453409856 |P1Thread1of1ForFork2_#t~ite25_Out-1453409856|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1453409856, ~z$flush_delayed~0=~z$flush_delayed~0_In-1453409856, ~z~0=~z~0_In-1453409856} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1453409856, ~z$flush_delayed~0=~z$flush_delayed~0_In-1453409856, ~z~0=~z~0_In-1453409856, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1453409856|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:39:18,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:39:18,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:39:18,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-343074817| |ULTIMATE.start_main_#t~ite58_Out-343074817|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-343074817 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-343074817 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-343074817 |ULTIMATE.start_main_#t~ite58_Out-343074817|) (not .cse1) .cse2) (and (= ~z~0_In-343074817 |ULTIMATE.start_main_#t~ite58_Out-343074817|) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-343074817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343074817, ~z$w_buff1~0=~z$w_buff1~0_In-343074817, ~z~0=~z~0_In-343074817} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-343074817, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-343074817|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343074817, ~z$w_buff1~0=~z$w_buff1~0_In-343074817, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-343074817|, ~z~0=~z~0_In-343074817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:39:18,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2045061993 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2045061993 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out2045061993| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2045061993 |ULTIMATE.start_main_#t~ite60_Out2045061993|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045061993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045061993} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2045061993|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045061993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045061993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:39:18,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1616103153 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1616103153 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1616103153 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1616103153 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1616103153|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1616103153 |ULTIMATE.start_main_#t~ite61_Out-1616103153|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1616103153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616103153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1616103153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616103153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1616103153, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1616103153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616103153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1616103153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616103153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:39:18,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1124343855 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1124343855 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1124343855 |ULTIMATE.start_main_#t~ite62_Out1124343855|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1124343855|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1124343855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1124343855} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1124343855|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1124343855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1124343855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:39:18,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2003363654 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2003363654 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2003363654 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2003363654 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out2003363654| ~z$r_buff1_thd0~0_In2003363654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out2003363654|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2003363654|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:39:18,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, 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 11:39:18,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:39:18 BasicIcfg [2019-12-07 11:39:18,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:39:18,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:39:18,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:39:18,433 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:39:18,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:38:03" (3/4) ... [2019-12-07 11:39:18,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:39:18,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t272~0.base_119|) |v_ULTIMATE.start_main_~#t272~0.offset_66| 0)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t272~0.base_119| 4)) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t272~0.base_119|) 0) (= 0 |v_ULTIMATE.start_main_~#t272~0.offset_66|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t272~0.base_119| 1) |v_#valid_150|) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t272~0.base_119|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ULTIMATE.start_main_~#t272~0.base=|v_ULTIMATE.start_main_~#t272~0.base_119|, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_39|, ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_~#t272~0.offset=|v_ULTIMATE.start_main_~#t272~0.offset_66|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t273~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t273~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t272~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t274~0.offset, ULTIMATE.start_main_~#t274~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t272~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:39:18,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t273~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t273~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t273~0.base_11| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t273~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t273~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t273~0.base_11|) |v_ULTIMATE.start_main_~#t273~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t273~0.offset=|v_ULTIMATE.start_main_~#t273~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t273~0.base=|v_ULTIMATE.start_main_~#t273~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t273~0.offset, #length, ULTIMATE.start_main_~#t273~0.base] because there is no mapped edge [2019-12-07 11:39:18,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t274~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t274~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t274~0.base_9| 1) |v_#valid_27|) (= 0 |v_ULTIMATE.start_main_~#t274~0.offset_8|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t274~0.base_9|) |v_ULTIMATE.start_main_~#t274~0.offset_8| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t274~0.base=|v_ULTIMATE.start_main_~#t274~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t274~0.offset=|v_ULTIMATE.start_main_~#t274~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t274~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t274~0.offset] because there is no mapped edge [2019-12-07 11:39:18,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:39:18,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In600474959 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In600474959 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In600474959 |P2Thread1of1ForFork0_#t~ite28_Out600474959|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff1~0_In600474959 |P2Thread1of1ForFork0_#t~ite28_Out600474959|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In600474959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959, ~z$w_buff1~0=~z$w_buff1~0_In600474959} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out600474959|, ~z$w_buff0~0=~z$w_buff0~0_In600474959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In600474959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In600474959, ~z$w_buff1~0=~z$w_buff1~0_In600474959} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:39:18,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:39:18,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:39:18,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1985662672 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out1985662672| ~z~0_In1985662672)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out1985662672| ~z$mem_tmp~0_In1985662672) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1985662672, ~z$flush_delayed~0=~z$flush_delayed~0_In1985662672, ~z~0=~z~0_In1985662672} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1985662672|, ~z$mem_tmp~0=~z$mem_tmp~0_In1985662672, ~z$flush_delayed~0=~z$flush_delayed~0_In1985662672, ~z~0=~z~0_In1985662672} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:39:18,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:39:18,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1605106035 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1605106035 256)))) (or (and (= ~z$w_buff0_used~0_In1605106035 |P2Thread1of1ForFork0_#t~ite51_Out1605106035|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1605106035|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1605106035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1605106035, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1605106035|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:39:18,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1693622312 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1693622312 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1693622312 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1693622312 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| ~z$w_buff1_used~0_In-1693622312)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1693622312| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693622312, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1693622312, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1693622312, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1693622312|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693622312} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:39:18,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1318378344 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-1318378344 ~z$r_buff0_thd3~0_Out-1318378344)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1318378344 256) 0))) (or (and (= ~z$r_buff0_thd3~0_Out-1318378344 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1318378344} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1318378344, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1318378344, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1318378344|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:39:18,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In900272780 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In900272780 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In900272780 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In900272780 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite54_Out900272780| ~z$r_buff1_thd3~0_In900272780) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out900272780| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In900272780, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900272780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900272780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900272780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In900272780, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out900272780|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In900272780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In900272780, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In900272780} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:39:18,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:39:18,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1453409856 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-1453409856| ~z$mem_tmp~0_In-1453409856)) (and (= ~z~0_In-1453409856 |P1Thread1of1ForFork2_#t~ite25_Out-1453409856|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1453409856, ~z$flush_delayed~0=~z$flush_delayed~0_In-1453409856, ~z~0=~z~0_In-1453409856} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1453409856, ~z$flush_delayed~0=~z$flush_delayed~0_In-1453409856, ~z~0=~z~0_In-1453409856, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1453409856|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:39:18,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:39:18,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:39:18,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-343074817| |ULTIMATE.start_main_#t~ite58_Out-343074817|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-343074817 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-343074817 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-343074817 |ULTIMATE.start_main_#t~ite58_Out-343074817|) (not .cse1) .cse2) (and (= ~z~0_In-343074817 |ULTIMATE.start_main_#t~ite58_Out-343074817|) .cse2 (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-343074817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343074817, ~z$w_buff1~0=~z$w_buff1~0_In-343074817, ~z~0=~z~0_In-343074817} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-343074817, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-343074817|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343074817, ~z$w_buff1~0=~z$w_buff1~0_In-343074817, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-343074817|, ~z~0=~z~0_In-343074817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:39:18,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2045061993 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2045061993 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out2045061993| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2045061993 |ULTIMATE.start_main_#t~ite60_Out2045061993|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045061993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045061993} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2045061993|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045061993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045061993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:39:18,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1616103153 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1616103153 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1616103153 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1616103153 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1616103153|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1616103153 |ULTIMATE.start_main_#t~ite61_Out-1616103153|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1616103153, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616103153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1616103153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616103153} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1616103153, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1616103153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616103153, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1616103153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616103153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:39:18,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1124343855 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1124343855 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1124343855 |ULTIMATE.start_main_#t~ite62_Out1124343855|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1124343855|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1124343855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1124343855} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1124343855|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1124343855, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1124343855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:39:18,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2003363654 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2003363654 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2003363654 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2003363654 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out2003363654| ~z$r_buff1_thd0~0_In2003363654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite63_Out2003363654|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2003363654|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2003363654, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2003363654, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2003363654, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2003363654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:39:18,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, 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 11:39:18,517 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_37fe4cea-741c-4340-83eb-ec865ed77a40/bin/utaipan/witness.graphml [2019-12-07 11:39:18,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:39:18,518 INFO L168 Benchmark]: Toolchain (without parser) took 75565.49 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 937.1 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 11:39:18,518 INFO L168 Benchmark]: CDTParser took 0.16 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 11:39:18,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:18,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.06 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 11:39:18,519 INFO L168 Benchmark]: Boogie Preprocessor took 26.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:18,519 INFO L168 Benchmark]: RCFGBuilder took 455.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.2 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:18,519 INFO L168 Benchmark]: TraceAbstraction took 74536.35 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 990.2 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 11:39:18,520 INFO L168 Benchmark]: Witness Printer took 84.32 ms. Allocated memory is still 6.4 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:18,521 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.16 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 418.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.06 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. * Boogie Preprocessor took 26.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.2 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74536.35 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 990.2 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 84.32 ms. Allocated memory is still 6.4 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 129 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 28 ChoiceCompositions, 9334 VarBasedMoverChecksPositive, 325 VarBasedMoverChecksNegative, 95 SemBasedMoverChecksPositive, 334 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 138188 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t272, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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] [L842] FCALL, FORK 0 pthread_create(&t273, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L844] FCALL, FORK 0 pthread_create(&t274, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L802] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L803] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L803] 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)) [L804] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L804] 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)) [L805] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L805] 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)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L806] 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)) [L808] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L808] 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)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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=1, 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] [L817] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, 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=1, 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] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L817] 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) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 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 [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L850] 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) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 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 [L853] 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, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 74.3s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7548 SDtfs, 11287 SDslu, 20981 SDs, 0 SdLazy, 8868 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 40 SyntacticMatches, 18 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140164occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 268305 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1089 NumberOfCodeBlocks, 1089 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 364039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...