./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/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 0fa591f2fa613ae5722b1eaacfa39b14021b1b6d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:28:51,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:28:51,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:28:51,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:28:51,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:28:51,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:28:51,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:28:51,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:28:51,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:28:51,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:28:51,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:28:51,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:28:51,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:28:51,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:28:51,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:28:51,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:28:51,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:28:51,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:28:51,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:28:51,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:28:51,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:28:51,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:28:51,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:28:51,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:28:51,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:28:51,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:28:51,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:28:51,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:28:51,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:28:51,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:28:51,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:28:51,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:28:51,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:28:51,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:28:51,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:28:51,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:28:51,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:28:51,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:28:51,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:28:51,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:28:51,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:28:51,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:28:51,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:28:51,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:28:51,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:28:51,808 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:28:51,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:28:51,809 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:28:51,809 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:28:51,809 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:28:51,809 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:28:51,809 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:28:51,810 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:28:51,810 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:28:51,810 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:28:51,810 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:28:51,810 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:28:51,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:28:51,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:28:51,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:28:51,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:28:51,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:28:51,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:28:51,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:28:51,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:28:51,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:28:51,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:28:51,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:28:51,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:28:51,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:28:51,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:28:51,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:28:51,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:28:51,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:28:51,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:28:51,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:28:51,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:28:51,815 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:28:51,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:28:51,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:28:51,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:28:51,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:28:51,816 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_701dae93-cc14-4acb-b437-8e52c5328e61/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 -> 0fa591f2fa613ae5722b1eaacfa39b14021b1b6d [2019-12-07 19:28:51,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:28:51,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:28:51,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:28:51,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:28:51,925 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:28:51,925 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix018_power.opt.i [2019-12-07 19:28:51,962 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/data/1734fd670/2d84811dbf88411aaab76c2394993a58/FLAGe64401161 [2019-12-07 19:28:52,424 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:28:52,424 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/sv-benchmarks/c/pthread-wmm/mix018_power.opt.i [2019-12-07 19:28:52,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/data/1734fd670/2d84811dbf88411aaab76c2394993a58/FLAGe64401161 [2019-12-07 19:28:52,445 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/data/1734fd670/2d84811dbf88411aaab76c2394993a58 [2019-12-07 19:28:52,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:28:52,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:28:52,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:28:52,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:28:52,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:28:52,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52, skipping insertion in model container [2019-12-07 19:28:52,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:28:52,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:28:52,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:28:52,758 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:28:52,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:28:52,846 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:28:52,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52 WrapperNode [2019-12-07 19:28:52,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:28:52,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:28:52,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:28:52,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:28:52,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:28:52,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:28:52,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:28:52,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:28:52,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... [2019-12-07 19:28:52,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:28:52,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:28:52,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:28:52,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:28:52,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:28:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:28:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:28:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:28:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:28:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:28:52,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:28:52,957 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:28:52,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:28:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:28:52,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:28:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 19:28:52,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 19:28:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:28:52,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:28:52,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:28:52,959 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 19:28:53,372 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:28:53,373 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:28:53,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:28:53 BoogieIcfgContainer [2019-12-07 19:28:53,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:28:53,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:28:53,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:28:53,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:28:53,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:28:52" (1/3) ... [2019-12-07 19:28:53,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35306c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:28:53, skipping insertion in model container [2019-12-07 19:28:53,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:28:52" (2/3) ... [2019-12-07 19:28:53,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35306c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:28:53, skipping insertion in model container [2019-12-07 19:28:53,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:28:53" (3/3) ... [2019-12-07 19:28:53,378 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_power.opt.i [2019-12-07 19:28:53,384 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:28:53,384 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:28:53,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:28:53,390 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:28:53,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,430 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,431 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,432 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,433 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,434 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,435 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,436 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,437 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,438 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,439 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,440 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,441 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,442 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:28:53,454 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 19:28:53,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:28:53,467 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:28:53,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:28:53,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:28:53,467 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:28:53,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:28:53,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:28:53,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:28:53,479 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 19:28:53,480 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 19:28:53,559 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 19:28:53,559 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:28:53,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 19:28:53,595 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 19:28:53,641 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 19:28:53,641 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:28:53,651 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 19:28:53,677 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 19:28:53,678 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:28:57,310 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 19:28:57,596 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 19:28:57,710 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 19:28:57,710 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 19:28:57,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 19:29:05,825 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 19:29:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 19:29:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:29:05,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:05,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:05,832 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:05,835 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 19:29:05,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:05,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868374084] [2019-12-07 19:29:05,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:29:06,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868374084] [2019-12-07 19:29:06,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:06,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:29:06,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136701352] [2019-12-07 19:29:06,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:29:06,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:29:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:06,023 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 19:29:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:06,775 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 19:29:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:29:06,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 19:29:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:07,263 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 19:29:07,264 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 19:29:07,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 19:29:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 19:29:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 19:29:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 19:29:11,984 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 19:29:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:11,985 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 19:29:11,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:29:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 19:29:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:29:11,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:11,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:11,991 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:11,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 19:29:11,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:11,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229182866] [2019-12-07 19:29:11,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:29:12,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229182866] [2019-12-07 19:29:12,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:12,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:12,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160246208] [2019-12-07 19:29:12,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:29:12,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:29:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:12,064 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 19:29:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:12,859 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 19:29:12,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:29:12,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 19:29:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:13,238 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 19:29:13,238 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 19:29:13,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:29:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 19:29:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 19:29:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 19:29:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 19:29:17,363 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 19:29:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:17,364 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 19:29:17,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:29:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 19:29:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:29:17,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:17,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:17,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 19:29:17,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:17,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079274644] [2019-12-07 19:29:17,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:29:17,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079274644] [2019-12-07 19:29:17,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:17,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:17,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031693615] [2019-12-07 19:29:17,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:29:17,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:29:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:17,412 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 19:29:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:18,304 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 19:29:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:29:18,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 19:29:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:18,725 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 19:29:18,726 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 19:29:18,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:29:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 19:29:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 19:29:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 19:29:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 19:29:24,718 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 19:29:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:24,718 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 19:29:24,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:29:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 19:29:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:29:24,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:24,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:24,728 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 19:29:24,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:24,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772821706] [2019-12-07 19:29:24,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:29:24,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772821706] [2019-12-07 19:29:24,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:24,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:29:24,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316473503] [2019-12-07 19:29:24,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:29:24,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:24,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:29:24,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:24,756 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 19:29:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:26,373 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 19:29:26,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:29:26,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:29:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:27,039 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 19:29:27,040 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 19:29:27,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 19:29:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 19:29:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 19:29:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 19:29:35,558 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 19:29:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:35,559 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 19:29:35,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:29:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 19:29:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:29:35,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:35,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:29:35,571 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 19:29:35,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:35,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428596002] [2019-12-07 19:29:35,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:35,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 19:29:35,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428596002] [2019-12-07 19:29:35,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:35,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:29:35,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213918345] [2019-12-07 19:29:35,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:29:35,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:35,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:29:35,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:35,634 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 19:29:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:37,461 INFO L93 Difference]: Finished difference Result 290673 states and 1193092 transitions. [2019-12-07 19:29:37,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:29:37,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:29:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:38,222 INFO L225 Difference]: With dead ends: 290673 [2019-12-07 19:29:38,222 INFO L226 Difference]: Without dead ends: 290139 [2019-12-07 19:29:38,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:29:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290139 states. [2019-12-07 19:29:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290139 to 284099. [2019-12-07 19:29:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284099 states. [2019-12-07 19:29:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284099 states to 284099 states and 1175709 transitions. [2019-12-07 19:29:48,716 INFO L78 Accepts]: Start accepts. Automaton has 284099 states and 1175709 transitions. Word has length 20 [2019-12-07 19:29:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:48,716 INFO L462 AbstractCegarLoop]: Abstraction has 284099 states and 1175709 transitions. [2019-12-07 19:29:48,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:29:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 284099 states and 1175709 transitions. [2019-12-07 19:29:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:29:48,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:48,733 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] [2019-12-07 19:29:48,733 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash 82789233, now seen corresponding path program 1 times [2019-12-07 19:29:48,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:48,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346996155] [2019-12-07 19:29:48,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:29:48,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346996155] [2019-12-07 19:29:48,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:48,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:48,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147073988] [2019-12-07 19:29:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:29:48,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:29:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:48,790 INFO L87 Difference]: Start difference. First operand 284099 states and 1175709 transitions. Second operand 4 states. [2019-12-07 19:29:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:29:50,627 INFO L93 Difference]: Finished difference Result 280111 states and 1156619 transitions. [2019-12-07 19:29:50,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:29:50,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 19:29:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:29:51,393 INFO L225 Difference]: With dead ends: 280111 [2019-12-07 19:29:51,393 INFO L226 Difference]: Without dead ends: 280111 [2019-12-07 19:29:51,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280111 states. [2019-12-07 19:29:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280111 to 238056. [2019-12-07 19:29:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238056 states. [2019-12-07 19:29:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238056 states to 238056 states and 1013256 transitions. [2019-12-07 19:29:58,973 INFO L78 Accepts]: Start accepts. Automaton has 238056 states and 1013256 transitions. Word has length 21 [2019-12-07 19:29:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:29:58,974 INFO L462 AbstractCegarLoop]: Abstraction has 238056 states and 1013256 transitions. [2019-12-07 19:29:58,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:29:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 238056 states and 1013256 transitions. [2019-12-07 19:29:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:29:58,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:29:58,989 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] [2019-12-07 19:29:58,989 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:29:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:29:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 19:29:58,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:29:58,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396079758] [2019-12-07 19:29:58,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:29:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:29:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:29:59,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396079758] [2019-12-07 19:29:59,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:29:59,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:29:59,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369340850] [2019-12-07 19:29:59,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:29:59,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:29:59,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:29:59,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:29:59,029 INFO L87 Difference]: Start difference. First operand 238056 states and 1013256 transitions. Second operand 4 states. [2019-12-07 19:30:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:00,571 INFO L93 Difference]: Finished difference Result 295440 states and 1242708 transitions. [2019-12-07 19:30:00,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:30:00,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 19:30:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:04,402 INFO L225 Difference]: With dead ends: 295440 [2019-12-07 19:30:04,402 INFO L226 Difference]: Without dead ends: 295372 [2019-12-07 19:30:04,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295372 states. [2019-12-07 19:30:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295372 to 241800. [2019-12-07 19:30:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241800 states. [2019-12-07 19:30:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241800 states to 241800 states and 1028744 transitions. [2019-12-07 19:30:11,686 INFO L78 Accepts]: Start accepts. Automaton has 241800 states and 1028744 transitions. Word has length 21 [2019-12-07 19:30:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:11,686 INFO L462 AbstractCegarLoop]: Abstraction has 241800 states and 1028744 transitions. [2019-12-07 19:30:11,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 241800 states and 1028744 transitions. [2019-12-07 19:30:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:30:11,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:11,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:11,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 19:30:11,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:11,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323968264] [2019-12-07 19:30:11,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:11,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323968264] [2019-12-07 19:30:11,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:11,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:11,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637637227] [2019-12-07 19:30:11,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:30:11,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:11,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:30:11,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:11,761 INFO L87 Difference]: Start difference. First operand 241800 states and 1028744 transitions. Second operand 5 states. [2019-12-07 19:30:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:13,707 INFO L93 Difference]: Finished difference Result 339428 states and 1415346 transitions. [2019-12-07 19:30:13,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:30:13,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 19:30:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:15,148 INFO L225 Difference]: With dead ends: 339428 [2019-12-07 19:30:15,148 INFO L226 Difference]: Without dead ends: 339372 [2019-12-07 19:30:15,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:30:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339372 states. [2019-12-07 19:30:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339372 to 262602. [2019-12-07 19:30:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262602 states. [2019-12-07 19:30:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262602 states to 262602 states and 1113916 transitions. [2019-12-07 19:30:26,194 INFO L78 Accepts]: Start accepts. Automaton has 262602 states and 1113916 transitions. Word has length 24 [2019-12-07 19:30:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:26,194 INFO L462 AbstractCegarLoop]: Abstraction has 262602 states and 1113916 transitions. [2019-12-07 19:30:26,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:30:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 262602 states and 1113916 transitions. [2019-12-07 19:30:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:30:26,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:26,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:26,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1719472782, now seen corresponding path program 1 times [2019-12-07 19:30:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:26,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687635071] [2019-12-07 19:30:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687635071] [2019-12-07 19:30:26,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:26,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:26,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434687775] [2019-12-07 19:30:26,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:30:26,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:30:26,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:30:26,300 INFO L87 Difference]: Start difference. First operand 262602 states and 1113916 transitions. Second operand 5 states. [2019-12-07 19:30:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:28,779 INFO L93 Difference]: Finished difference Result 350554 states and 1461205 transitions. [2019-12-07 19:30:28,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:30:28,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 19:30:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:29,740 INFO L225 Difference]: With dead ends: 350554 [2019-12-07 19:30:29,740 INFO L226 Difference]: Without dead ends: 350442 [2019-12-07 19:30:29,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:30:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350442 states. [2019-12-07 19:30:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350442 to 245856. [2019-12-07 19:30:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245856 states. [2019-12-07 19:30:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245856 states to 245856 states and 1044184 transitions. [2019-12-07 19:30:38,004 INFO L78 Accepts]: Start accepts. Automaton has 245856 states and 1044184 transitions. Word has length 27 [2019-12-07 19:30:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:38,004 INFO L462 AbstractCegarLoop]: Abstraction has 245856 states and 1044184 transitions. [2019-12-07 19:30:38,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:30:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 245856 states and 1044184 transitions. [2019-12-07 19:30:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 19:30:38,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:38,197 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 19:30:38,197 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1681941858, now seen corresponding path program 1 times [2019-12-07 19:30:38,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:38,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991409126] [2019-12-07 19:30:38,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:38,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991409126] [2019-12-07 19:30:38,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:38,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:38,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332819874] [2019-12-07 19:30:38,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:38,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:38,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:38,247 INFO L87 Difference]: Start difference. First operand 245856 states and 1044184 transitions. Second operand 4 states. [2019-12-07 19:30:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:41,982 INFO L93 Difference]: Finished difference Result 286862 states and 1181164 transitions. [2019-12-07 19:30:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:30:41,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 19:30:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:42,737 INFO L225 Difference]: With dead ends: 286862 [2019-12-07 19:30:42,737 INFO L226 Difference]: Without dead ends: 286862 [2019-12-07 19:30:42,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286862 states. [2019-12-07 19:30:48,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286862 to 244520. [2019-12-07 19:30:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244520 states. [2019-12-07 19:30:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244520 states to 244520 states and 1037246 transitions. [2019-12-07 19:30:49,976 INFO L78 Accepts]: Start accepts. Automaton has 244520 states and 1037246 transitions. Word has length 34 [2019-12-07 19:30:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:49,976 INFO L462 AbstractCegarLoop]: Abstraction has 244520 states and 1037246 transitions. [2019-12-07 19:30:49,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:30:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 244520 states and 1037246 transitions. [2019-12-07 19:30:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 19:30:50,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:50,185 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 19:30:50,185 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash -410789176, now seen corresponding path program 1 times [2019-12-07 19:30:50,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:50,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615624287] [2019-12-07 19:30:50,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:50,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615624287] [2019-12-07 19:30:50,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:50,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:30:50,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107078133] [2019-12-07 19:30:50,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:30:50,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:30:50,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:50,225 INFO L87 Difference]: Start difference. First operand 244520 states and 1037246 transitions. Second operand 3 states. [2019-12-07 19:30:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:30:51,243 INFO L93 Difference]: Finished difference Result 229894 states and 962440 transitions. [2019-12-07 19:30:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:30:51,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 19:30:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:30:52,462 INFO L225 Difference]: With dead ends: 229894 [2019-12-07 19:30:52,462 INFO L226 Difference]: Without dead ends: 229894 [2019-12-07 19:30:52,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:30:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229894 states. [2019-12-07 19:30:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229894 to 228274. [2019-12-07 19:30:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228274 states. [2019-12-07 19:30:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228274 states to 228274 states and 956382 transitions. [2019-12-07 19:30:58,657 INFO L78 Accepts]: Start accepts. Automaton has 228274 states and 956382 transitions. Word has length 35 [2019-12-07 19:30:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:30:58,657 INFO L462 AbstractCegarLoop]: Abstraction has 228274 states and 956382 transitions. [2019-12-07 19:30:58,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:30:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 228274 states and 956382 transitions. [2019-12-07 19:30:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:30:58,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:30:58,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:30:58,842 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:30:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:30:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1013939211, now seen corresponding path program 1 times [2019-12-07 19:30:58,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:30:58,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705755019] [2019-12-07 19:30:58,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:30:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:30:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:30:58,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705755019] [2019-12-07 19:30:58,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:30:58,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:30:58,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900644913] [2019-12-07 19:30:58,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:30:58,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:30:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:30:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:30:58,900 INFO L87 Difference]: Start difference. First operand 228274 states and 956382 transitions. Second operand 4 states. [2019-12-07 19:31:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:02,474 INFO L93 Difference]: Finished difference Result 277255 states and 1114196 transitions. [2019-12-07 19:31:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:31:02,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 19:31:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:03,035 INFO L225 Difference]: With dead ends: 277255 [2019-12-07 19:31:03,035 INFO L226 Difference]: Without dead ends: 214325 [2019-12-07 19:31:03,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:31:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214325 states. [2019-12-07 19:31:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214325 to 198602. [2019-12-07 19:31:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198602 states. [2019-12-07 19:31:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198602 states to 198602 states and 798763 transitions. [2019-12-07 19:31:08,506 INFO L78 Accepts]: Start accepts. Automaton has 198602 states and 798763 transitions. Word has length 36 [2019-12-07 19:31:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:08,506 INFO L462 AbstractCegarLoop]: Abstraction has 198602 states and 798763 transitions. [2019-12-07 19:31:08,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:31:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 198602 states and 798763 transitions. [2019-12-07 19:31:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:31:08,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:08,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:08,690 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:08,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1981311576, now seen corresponding path program 1 times [2019-12-07 19:31:08,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:08,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259058526] [2019-12-07 19:31:08,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:31:08,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259058526] [2019-12-07 19:31:08,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:08,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:31:08,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147128471] [2019-12-07 19:31:08,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:31:08,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:31:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:31:08,785 INFO L87 Difference]: Start difference. First operand 198602 states and 798763 transitions. Second operand 8 states. [2019-12-07 19:31:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:11,466 INFO L93 Difference]: Finished difference Result 413818 states and 1666850 transitions. [2019-12-07 19:31:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 19:31:11,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 19:31:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:12,589 INFO L225 Difference]: With dead ends: 413818 [2019-12-07 19:31:12,589 INFO L226 Difference]: Without dead ends: 413818 [2019-12-07 19:31:12,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:31:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413818 states. [2019-12-07 19:31:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413818 to 318974. [2019-12-07 19:31:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318974 states. [2019-12-07 19:31:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318974 states to 318974 states and 1293389 transitions. [2019-12-07 19:31:22,365 INFO L78 Accepts]: Start accepts. Automaton has 318974 states and 1293389 transitions. Word has length 36 [2019-12-07 19:31:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:22,365 INFO L462 AbstractCegarLoop]: Abstraction has 318974 states and 1293389 transitions. [2019-12-07 19:31:22,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:31:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 318974 states and 1293389 transitions. [2019-12-07 19:31:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:31:22,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:22,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:22,685 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1204663696, now seen corresponding path program 2 times [2019-12-07 19:31:22,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:22,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667255149] [2019-12-07 19:31:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:31:22,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667255149] [2019-12-07 19:31:22,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:22,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:31:22,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463162132] [2019-12-07 19:31:22,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:31:22,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:31:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:31:22,762 INFO L87 Difference]: Start difference. First operand 318974 states and 1293389 transitions. Second operand 8 states. [2019-12-07 19:31:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:29,995 INFO L93 Difference]: Finished difference Result 604552 states and 2433592 transitions. [2019-12-07 19:31:29,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 19:31:29,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 19:31:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:31,342 INFO L225 Difference]: With dead ends: 604552 [2019-12-07 19:31:31,343 INFO L226 Difference]: Without dead ends: 502708 [2019-12-07 19:31:31,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:31:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502708 states. [2019-12-07 19:31:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502708 to 379318. [2019-12-07 19:31:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379318 states. [2019-12-07 19:31:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379318 states to 379318 states and 1541804 transitions. [2019-12-07 19:31:43,009 INFO L78 Accepts]: Start accepts. Automaton has 379318 states and 1541804 transitions. Word has length 36 [2019-12-07 19:31:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:31:43,009 INFO L462 AbstractCegarLoop]: Abstraction has 379318 states and 1541804 transitions. [2019-12-07 19:31:43,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:31:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 379318 states and 1541804 transitions. [2019-12-07 19:31:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:31:43,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:31:43,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:31:43,455 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:31:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:31:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash -439671128, now seen corresponding path program 3 times [2019-12-07 19:31:43,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:31:43,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145761315] [2019-12-07 19:31:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:31:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:31:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:31:43,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145761315] [2019-12-07 19:31:43,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:31:43,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:31:43,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305109308] [2019-12-07 19:31:43,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:31:43,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:31:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:31:43,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:31:43,546 INFO L87 Difference]: Start difference. First operand 379318 states and 1541804 transitions. Second operand 10 states. [2019-12-07 19:31:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:31:47,754 INFO L93 Difference]: Finished difference Result 683129 states and 2771219 transitions. [2019-12-07 19:31:47,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 19:31:47,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-12-07 19:31:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:31:49,924 INFO L225 Difference]: With dead ends: 683129 [2019-12-07 19:31:49,924 INFO L226 Difference]: Without dead ends: 645721 [2019-12-07 19:31:49,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:31:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645721 states. [2019-12-07 19:32:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645721 to 362330. [2019-12-07 19:32:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362330 states. [2019-12-07 19:32:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362330 states to 362330 states and 1470275 transitions. [2019-12-07 19:32:07,150 INFO L78 Accepts]: Start accepts. Automaton has 362330 states and 1470275 transitions. Word has length 36 [2019-12-07 19:32:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:07,150 INFO L462 AbstractCegarLoop]: Abstraction has 362330 states and 1470275 transitions. [2019-12-07 19:32:07,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:32:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 362330 states and 1470275 transitions. [2019-12-07 19:32:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 19:32:08,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:08,135 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] [2019-12-07 19:32:08,135 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash 262926389, now seen corresponding path program 1 times [2019-12-07 19:32:08,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:08,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604884236] [2019-12-07 19:32:08,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:08,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604884236] [2019-12-07 19:32:08,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:08,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:08,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303943014] [2019-12-07 19:32:08,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:08,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:08,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:08,182 INFO L87 Difference]: Start difference. First operand 362330 states and 1470275 transitions. Second operand 5 states. [2019-12-07 19:32:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:08,639 INFO L93 Difference]: Finished difference Result 132207 states and 449003 transitions. [2019-12-07 19:32:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:32:08,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 19:32:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:08,830 INFO L225 Difference]: With dead ends: 132207 [2019-12-07 19:32:08,830 INFO L226 Difference]: Without dead ends: 111963 [2019-12-07 19:32:08,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111963 states. [2019-12-07 19:32:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111963 to 111492. [2019-12-07 19:32:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111492 states. [2019-12-07 19:32:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111492 states to 111492 states and 368599 transitions. [2019-12-07 19:32:11,484 INFO L78 Accepts]: Start accepts. Automaton has 111492 states and 368599 transitions. Word has length 37 [2019-12-07 19:32:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:11,484 INFO L462 AbstractCegarLoop]: Abstraction has 111492 states and 368599 transitions. [2019-12-07 19:32:11,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 111492 states and 368599 transitions. [2019-12-07 19:32:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 19:32:11,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:11,572 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] [2019-12-07 19:32:11,572 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 445827019, now seen corresponding path program 1 times [2019-12-07 19:32:11,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:11,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825101175] [2019-12-07 19:32:11,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:11,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825101175] [2019-12-07 19:32:11,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:11,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:32:11,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111861566] [2019-12-07 19:32:11,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:11,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:11,630 INFO L87 Difference]: Start difference. First operand 111492 states and 368599 transitions. Second operand 6 states. [2019-12-07 19:32:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:11,752 INFO L93 Difference]: Finished difference Result 28174 states and 88388 transitions. [2019-12-07 19:32:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:32:11,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 19:32:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:11,783 INFO L225 Difference]: With dead ends: 28174 [2019-12-07 19:32:11,783 INFO L226 Difference]: Without dead ends: 22620 [2019-12-07 19:32:11,783 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 19:32:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22620 states. [2019-12-07 19:32:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22620 to 21079. [2019-12-07 19:32:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21079 states. [2019-12-07 19:32:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21079 states to 21079 states and 64676 transitions. [2019-12-07 19:32:12,064 INFO L78 Accepts]: Start accepts. Automaton has 21079 states and 64676 transitions. Word has length 38 [2019-12-07 19:32:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:12,064 INFO L462 AbstractCegarLoop]: Abstraction has 21079 states and 64676 transitions. [2019-12-07 19:32:12,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 21079 states and 64676 transitions. [2019-12-07 19:32:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 19:32:12,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:12,084 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] [2019-12-07 19:32:12,084 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash 951052415, now seen corresponding path program 1 times [2019-12-07 19:32:12,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:12,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124092067] [2019-12-07 19:32:12,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:12,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124092067] [2019-12-07 19:32:12,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:12,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:12,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218023604] [2019-12-07 19:32:12,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:12,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:12,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:12,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:12,143 INFO L87 Difference]: Start difference. First operand 21079 states and 64676 transitions. Second operand 4 states. [2019-12-07 19:32:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:12,237 INFO L93 Difference]: Finished difference Result 23438 states and 70473 transitions. [2019-12-07 19:32:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:32:12,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 19:32:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:12,264 INFO L225 Difference]: With dead ends: 23438 [2019-12-07 19:32:12,264 INFO L226 Difference]: Without dead ends: 22721 [2019-12-07 19:32:12,264 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 19:32:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22721 states. [2019-12-07 19:32:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22721 to 22056. [2019-12-07 19:32:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22056 states. [2019-12-07 19:32:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22056 states to 22056 states and 66911 transitions. [2019-12-07 19:32:12,545 INFO L78 Accepts]: Start accepts. Automaton has 22056 states and 66911 transitions. Word has length 49 [2019-12-07 19:32:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:12,546 INFO L462 AbstractCegarLoop]: Abstraction has 22056 states and 66911 transitions. [2019-12-07 19:32:12,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22056 states and 66911 transitions. [2019-12-07 19:32:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 19:32:12,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:12,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:12,567 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -506273965, now seen corresponding path program 2 times [2019-12-07 19:32:12,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:12,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391742868] [2019-12-07 19:32:12,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:12,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391742868] [2019-12-07 19:32:12,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:12,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:12,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341001940] [2019-12-07 19:32:12,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:32:12,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:12,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:32:12,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:12,629 INFO L87 Difference]: Start difference. First operand 22056 states and 66911 transitions. Second operand 5 states. [2019-12-07 19:32:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:12,736 INFO L93 Difference]: Finished difference Result 25176 states and 75205 transitions. [2019-12-07 19:32:12,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:32:12,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-07 19:32:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:12,761 INFO L225 Difference]: With dead ends: 25176 [2019-12-07 19:32:12,761 INFO L226 Difference]: Without dead ends: 21236 [2019-12-07 19:32:12,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-07 19:32:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 20578. [2019-12-07 19:32:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20578 states. [2019-12-07 19:32:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20578 states to 20578 states and 63351 transitions. [2019-12-07 19:32:13,441 INFO L78 Accepts]: Start accepts. Automaton has 20578 states and 63351 transitions. Word has length 49 [2019-12-07 19:32:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:13,441 INFO L462 AbstractCegarLoop]: Abstraction has 20578 states and 63351 transitions. [2019-12-07 19:32:13,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:32:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20578 states and 63351 transitions. [2019-12-07 19:32:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 19:32:13,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:13,459 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] [2019-12-07 19:32:13,459 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2143277843, now seen corresponding path program 3 times [2019-12-07 19:32:13,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:13,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647809414] [2019-12-07 19:32:13,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:13,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647809414] [2019-12-07 19:32:13,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:13,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:32:13,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048141224] [2019-12-07 19:32:13,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:32:13,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:32:13,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:32:13,530 INFO L87 Difference]: Start difference. First operand 20578 states and 63351 transitions. Second operand 7 states. [2019-12-07 19:32:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:13,650 INFO L93 Difference]: Finished difference Result 18588 states and 58880 transitions. [2019-12-07 19:32:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:32:13,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 19:32:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:13,659 INFO L225 Difference]: With dead ends: 18588 [2019-12-07 19:32:13,659 INFO L226 Difference]: Without dead ends: 6206 [2019-12-07 19:32:13,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-07 19:32:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 6078. [2019-12-07 19:32:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6078 states. [2019-12-07 19:32:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 16123 transitions. [2019-12-07 19:32:13,729 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 16123 transitions. Word has length 49 [2019-12-07 19:32:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:13,730 INFO L462 AbstractCegarLoop]: Abstraction has 6078 states and 16123 transitions. [2019-12-07 19:32:13,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:32:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 16123 transitions. [2019-12-07 19:32:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:32:13,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:13,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:13,734 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -505309043, now seen corresponding path program 1 times [2019-12-07 19:32:13,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:13,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047708221] [2019-12-07 19:32:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:13,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047708221] [2019-12-07 19:32:13,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:13,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:32:13,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593676730] [2019-12-07 19:32:13,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:32:13,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:32:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:32:13,779 INFO L87 Difference]: Start difference. First operand 6078 states and 16123 transitions. Second operand 6 states. [2019-12-07 19:32:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:13,926 INFO L93 Difference]: Finished difference Result 11627 states and 31413 transitions. [2019-12-07 19:32:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:32:13,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 19:32:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:13,939 INFO L225 Difference]: With dead ends: 11627 [2019-12-07 19:32:13,939 INFO L226 Difference]: Without dead ends: 9365 [2019-12-07 19:32:13,939 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 19:32:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2019-12-07 19:32:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 6690. [2019-12-07 19:32:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6690 states. [2019-12-07 19:32:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6690 states to 6690 states and 17566 transitions. [2019-12-07 19:32:14,038 INFO L78 Accepts]: Start accepts. Automaton has 6690 states and 17566 transitions. Word has length 65 [2019-12-07 19:32:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:14,038 INFO L462 AbstractCegarLoop]: Abstraction has 6690 states and 17566 transitions. [2019-12-07 19:32:14,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:32:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6690 states and 17566 transitions. [2019-12-07 19:32:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:32:14,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:14,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:14,044 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash 113616463, now seen corresponding path program 2 times [2019-12-07 19:32:14,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:14,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590908025] [2019-12-07 19:32:14,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:14,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590908025] [2019-12-07 19:32:14,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:14,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:32:14,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366422237] [2019-12-07 19:32:14,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:32:14,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:32:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:32:14,078 INFO L87 Difference]: Start difference. First operand 6690 states and 17566 transitions. Second operand 4 states. [2019-12-07 19:32:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:14,101 INFO L93 Difference]: Finished difference Result 7163 states and 18622 transitions. [2019-12-07 19:32:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:32:14,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 19:32:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:14,102 INFO L225 Difference]: With dead ends: 7163 [2019-12-07 19:32:14,102 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 19:32:14,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:32:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 19:32:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 19:32:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 19:32:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 19:32:14,107 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 65 [2019-12-07 19:32:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:14,108 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 19:32:14,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:32:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 19:32:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:32:14,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:14,108 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:14,109 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 1 times [2019-12-07 19:32:14,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:14,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953600889] [2019-12-07 19:32:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:32:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:32:14,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953600889] [2019-12-07 19:32:14,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:32:14,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:32:14,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800211878] [2019-12-07 19:32:14,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:32:14,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:32:14,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:32:14,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:32:14,246 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 11 states. [2019-12-07 19:32:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:32:14,689 INFO L93 Difference]: Finished difference Result 1150 states and 2426 transitions. [2019-12-07 19:32:14,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 19:32:14,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 19:32:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:32:14,690 INFO L225 Difference]: With dead ends: 1150 [2019-12-07 19:32:14,690 INFO L226 Difference]: Without dead ends: 835 [2019-12-07 19:32:14,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:32:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-07 19:32:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 619. [2019-12-07 19:32:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-12-07 19:32:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1294 transitions. [2019-12-07 19:32:14,696 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1294 transitions. Word has length 66 [2019-12-07 19:32:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:32:14,696 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 1294 transitions. [2019-12-07 19:32:14,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:32:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1294 transitions. [2019-12-07 19:32:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:32:14,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:32:14,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:32:14,698 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:32:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:32:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 2 times [2019-12-07 19:32:14,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:32:14,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075176184] [2019-12-07 19:32:14,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:32:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:32:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:32:14,796 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:32:14,796 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:32:14,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t469~0.base_38|) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38|)) (= v_~z$r_buff0_thd1~0_132 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38| 1)) (= v_~y~0_46 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t469~0.base_38| 4)) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 |v_ULTIMATE.start_main_~#t469~0.offset_25|) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38|) |v_ULTIMATE.start_main_~#t469~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_26|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ULTIMATE.start_main_~#t469~0.base=|v_ULTIMATE.start_main_~#t469~0.base_38|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~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_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_40|, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t469~0.offset=|v_ULTIMATE.start_main_~#t469~0.offset_25|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_30|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t470~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t469~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~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_~#t471~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t470~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t469~0.offset, ULTIMATE.start_main_~#t472~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t471~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:32:14,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11| 1) |v_#valid_45|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t470~0.base_11| 4)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11|) |v_ULTIMATE.start_main_~#t470~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t470~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t470~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t470~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t470~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t470~0.base] because there is no mapped edge [2019-12-07 19:32:14,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t471~0.base_11| 4)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11| 1) |v_#valid_43|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11|) |v_ULTIMATE.start_main_~#t471~0.offset_11| 2)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t471~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t471~0.base_11|) (= |v_ULTIMATE.start_main_~#t471~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t471~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t471~0.base, #length] because there is no mapped edge [2019-12-07 19:32:14,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t472~0.offset_8|) (not (= 0 |v_ULTIMATE.start_main_~#t472~0.base_9|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9| 1)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9|) |v_ULTIMATE.start_main_~#t472~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t472~0.base_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t472~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t472~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 19:32:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= |P3Thread1of1ForFork2_#t~nondet27_In1457218595| ~weak$$choice2~0_Out1457218595) (= ~z$r_buff0_thd4~0_Out1457218595 1) (= ~z$r_buff0_thd4~0_In1457218595 ~z$r_buff1_thd4~0_Out1457218595) (= ~weak$$choice2~0_Out1457218595 ~z$flush_delayed~0_Out1457218595) (= ~z$r_buff0_thd0~0_In1457218595 ~z$r_buff1_thd0~0_Out1457218595) (= |P3Thread1of1ForFork2_#t~nondet26_In1457218595| ~weak$$choice0~0_Out1457218595) (= ~z$r_buff1_thd1~0_Out1457218595 ~z$r_buff0_thd1~0_In1457218595) (= ~z$r_buff1_thd2~0_Out1457218595 ~z$r_buff0_thd2~0_In1457218595) (= ~z~0_In1457218595 ~z$mem_tmp~0_Out1457218595) (= ~z$r_buff1_thd3~0_Out1457218595 ~z$r_buff0_thd3~0_In1457218595) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1457218595))) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In1457218595|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In1457218595|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1457218595, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1457218595, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1457218595, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1457218595, ~z~0=~z~0_In1457218595, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1457218595, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1457218595} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out1457218595|, ~z$mem_tmp~0=~z$mem_tmp~0_Out1457218595, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out1457218595|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1457218595, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1457218595, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1457218595, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1457218595, ~z$flush_delayed~0=~z$flush_delayed~0_Out1457218595, ~weak$$choice0~0=~weak$$choice0~0_Out1457218595, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1457218595, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1457218595, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1457218595, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1457218595, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1457218595, ~z~0=~z~0_In1457218595, ~weak$$choice2~0=~weak$$choice2~0_Out1457218595, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1457218595, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1457218595} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 19:32:14,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out1485852406| |P3Thread1of1ForFork2_#t~ite28_Out1485852406|)) (.cse0 (= (mod ~z$w_buff0_used~0_In1485852406 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1485852406 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out1485852406| ~z$w_buff0~0_In1485852406) (not .cse0) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1485852406| ~z$w_buff1~0_In1485852406) .cse2 (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1485852406, ~z$w_buff1~0=~z$w_buff1~0_In1485852406} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1485852406|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1485852406|, ~z$w_buff0~0=~z$w_buff0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1485852406, ~z$w_buff1~0=~z$w_buff1~0_In1485852406} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 19:32:14,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 19:32:14,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-535797904 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-535797904| ~z~0_In-535797904) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-535797904| ~z$mem_tmp~0_In-535797904) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-535797904, ~z$flush_delayed~0=~z$flush_delayed~0_In-535797904, ~z~0=~z~0_In-535797904} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-535797904, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-535797904|, ~z$flush_delayed~0=~z$flush_delayed~0_In-535797904, ~z~0=~z~0_In-535797904} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 19:32:14,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 19:32:14,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 19:32:14,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-934631178 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-934631178 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-934631178 |P3Thread1of1ForFork2_#t~ite51_Out-934631178|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-934631178|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-934631178, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-934631178} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-934631178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-934631178, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-934631178} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 19:32:14,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-451057561 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-451057561| ~z~0_In-451057561) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-451057561 |P2Thread1of1ForFork1_#t~ite25_Out-451057561|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-451057561, ~z$flush_delayed~0=~z$flush_delayed~0_In-451057561, ~z~0=~z~0_In-451057561} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-451057561, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-451057561|, ~z$flush_delayed~0=~z$flush_delayed~0_In-451057561, ~z~0=~z~0_In-451057561} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 19:32:14,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-22631214 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-22631214 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-22631214 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-22631214 256) 0))) (or (and (= ~z$w_buff1_used~0_In-22631214 |P3Thread1of1ForFork2_#t~ite52_Out-22631214|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-22631214|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-22631214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-22631214, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-22631214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22631214} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-22631214|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-22631214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-22631214, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-22631214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22631214} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 19:32:14,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1267193175 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out-1267193175 ~z$r_buff0_thd4~0_In-1267193175)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1267193175 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out-1267193175 0) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1267193175} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1267193175|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1267193175} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 19:32:14,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In60314441 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In60314441 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In60314441 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In60314441 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out60314441|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In60314441 |P3Thread1of1ForFork2_#t~ite54_Out60314441|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In60314441, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60314441, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In60314441, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60314441} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out60314441|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In60314441, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60314441, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In60314441, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60314441} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 19:32:14,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:32:14,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:32:14,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:32:14,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-478336322 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-478336322 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-478336322 |ULTIMATE.start_main_#t~ite59_Out-478336322|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-478336322| ~z~0_In-478336322)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-478336322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-478336322, ~z$w_buff1~0=~z$w_buff1~0_In-478336322, ~z~0=~z~0_In-478336322} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-478336322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-478336322, ~z$w_buff1~0=~z$w_buff1~0_In-478336322, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-478336322|, ~z~0=~z~0_In-478336322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 19:32:14,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 19:32:14,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-247934168 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-247934168 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-247934168|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-247934168 |ULTIMATE.start_main_#t~ite61_Out-247934168|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-247934168, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-247934168} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-247934168, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-247934168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-247934168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 19:32:14,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1183066272 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1183066272 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1183066272 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1183066272 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1183066272| ~z$w_buff1_used~0_In-1183066272) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1183066272| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1183066272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183066272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1183066272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1183066272} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1183066272|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1183066272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183066272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1183066272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1183066272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 19:32:14,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-212691971 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-212691971 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-212691971| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-212691971| ~z$r_buff0_thd0~0_In-212691971)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-212691971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-212691971} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-212691971|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-212691971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-212691971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 19:32:14,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In564321326 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In564321326 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In564321326 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In564321326 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out564321326|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In564321326 |ULTIMATE.start_main_#t~ite64_Out564321326|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In564321326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In564321326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In564321326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In564321326} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In564321326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In564321326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In564321326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In564321326, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out564321326|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 19:32:14,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:32:14,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:32:14 BasicIcfg [2019-12-07 19:32:14,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:32:14,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:32:14,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:32:14,890 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:32:14,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:28:53" (3/4) ... [2019-12-07 19:32:14,892 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:32:14,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t469~0.base_38|) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38|)) (= v_~z$r_buff0_thd1~0_132 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38| 1)) (= v_~y~0_46 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t469~0.base_38| 4)) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 |v_ULTIMATE.start_main_~#t469~0.offset_25|) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38|) |v_ULTIMATE.start_main_~#t469~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_26|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ULTIMATE.start_main_~#t469~0.base=|v_ULTIMATE.start_main_~#t469~0.base_38|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~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_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_40|, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t469~0.offset=|v_ULTIMATE.start_main_~#t469~0.offset_25|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_30|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t470~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t469~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~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_~#t471~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t470~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t469~0.offset, ULTIMATE.start_main_~#t472~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t471~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:32:14,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11| 1) |v_#valid_45|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t470~0.base_11| 4)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11|) |v_ULTIMATE.start_main_~#t470~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t470~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t470~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t470~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t470~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t470~0.base] because there is no mapped edge [2019-12-07 19:32:14,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t471~0.base_11| 4)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11| 1) |v_#valid_43|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11|) |v_ULTIMATE.start_main_~#t471~0.offset_11| 2)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t471~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t471~0.base_11|) (= |v_ULTIMATE.start_main_~#t471~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t471~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t471~0.base, #length] because there is no mapped edge [2019-12-07 19:32:14,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t472~0.offset_8|) (not (= 0 |v_ULTIMATE.start_main_~#t472~0.base_9|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9| 1)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9|) |v_ULTIMATE.start_main_~#t472~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t472~0.base_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t472~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t472~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 19:32:14,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= |P3Thread1of1ForFork2_#t~nondet27_In1457218595| ~weak$$choice2~0_Out1457218595) (= ~z$r_buff0_thd4~0_Out1457218595 1) (= ~z$r_buff0_thd4~0_In1457218595 ~z$r_buff1_thd4~0_Out1457218595) (= ~weak$$choice2~0_Out1457218595 ~z$flush_delayed~0_Out1457218595) (= ~z$r_buff0_thd0~0_In1457218595 ~z$r_buff1_thd0~0_Out1457218595) (= |P3Thread1of1ForFork2_#t~nondet26_In1457218595| ~weak$$choice0~0_Out1457218595) (= ~z$r_buff1_thd1~0_Out1457218595 ~z$r_buff0_thd1~0_In1457218595) (= ~z$r_buff1_thd2~0_Out1457218595 ~z$r_buff0_thd2~0_In1457218595) (= ~z~0_In1457218595 ~z$mem_tmp~0_Out1457218595) (= ~z$r_buff1_thd3~0_Out1457218595 ~z$r_buff0_thd3~0_In1457218595) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1457218595))) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In1457218595|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In1457218595|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1457218595, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1457218595, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1457218595, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1457218595, ~z~0=~z~0_In1457218595, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1457218595, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1457218595} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out1457218595|, ~z$mem_tmp~0=~z$mem_tmp~0_Out1457218595, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out1457218595|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1457218595, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1457218595, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1457218595, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1457218595, ~z$flush_delayed~0=~z$flush_delayed~0_Out1457218595, ~weak$$choice0~0=~weak$$choice0~0_Out1457218595, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1457218595, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1457218595, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1457218595, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1457218595, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1457218595, ~z~0=~z~0_In1457218595, ~weak$$choice2~0=~weak$$choice2~0_Out1457218595, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1457218595, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1457218595} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 19:32:14,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out1485852406| |P3Thread1of1ForFork2_#t~ite28_Out1485852406|)) (.cse0 (= (mod ~z$w_buff0_used~0_In1485852406 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1485852406 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out1485852406| ~z$w_buff0~0_In1485852406) (not .cse0) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1485852406| ~z$w_buff1~0_In1485852406) .cse2 (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1485852406, ~z$w_buff1~0=~z$w_buff1~0_In1485852406} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1485852406|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1485852406|, ~z$w_buff0~0=~z$w_buff0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1485852406, ~z$w_buff1~0=~z$w_buff1~0_In1485852406} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 19:32:14,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 19:32:14,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-535797904 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-535797904| ~z~0_In-535797904) .cse0) (and (= |P3Thread1of1ForFork2_#t~ite48_Out-535797904| ~z$mem_tmp~0_In-535797904) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-535797904, ~z$flush_delayed~0=~z$flush_delayed~0_In-535797904, ~z~0=~z~0_In-535797904} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-535797904, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-535797904|, ~z$flush_delayed~0=~z$flush_delayed~0_In-535797904, ~z~0=~z~0_In-535797904} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 19:32:14,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 19:32:14,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 19:32:14,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-934631178 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-934631178 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-934631178 |P3Thread1of1ForFork2_#t~ite51_Out-934631178|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-934631178|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-934631178, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-934631178} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-934631178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-934631178, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-934631178} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 19:32:14,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-451057561 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-451057561| ~z~0_In-451057561) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-451057561 |P2Thread1of1ForFork1_#t~ite25_Out-451057561|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-451057561, ~z$flush_delayed~0=~z$flush_delayed~0_In-451057561, ~z~0=~z~0_In-451057561} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-451057561, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-451057561|, ~z$flush_delayed~0=~z$flush_delayed~0_In-451057561, ~z~0=~z~0_In-451057561} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 19:32:14,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-22631214 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-22631214 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-22631214 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-22631214 256) 0))) (or (and (= ~z$w_buff1_used~0_In-22631214 |P3Thread1of1ForFork2_#t~ite52_Out-22631214|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-22631214|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-22631214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-22631214, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-22631214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22631214} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-22631214|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-22631214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-22631214, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-22631214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22631214} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1267193175 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out-1267193175 ~z$r_buff0_thd4~0_In-1267193175)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1267193175 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out-1267193175 0) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1267193175} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1267193175|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1267193175} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In60314441 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In60314441 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In60314441 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In60314441 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out60314441|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In60314441 |P3Thread1of1ForFork2_#t~ite54_Out60314441|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In60314441, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60314441, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In60314441, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60314441} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out60314441|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In60314441, ~z$w_buff0_used~0=~z$w_buff0_used~0_In60314441, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In60314441, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60314441} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-478336322 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-478336322 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-478336322 |ULTIMATE.start_main_#t~ite59_Out-478336322|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-478336322| ~z~0_In-478336322)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-478336322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-478336322, ~z$w_buff1~0=~z$w_buff1~0_In-478336322, ~z~0=~z~0_In-478336322} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-478336322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-478336322, ~z$w_buff1~0=~z$w_buff1~0_In-478336322, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-478336322|, ~z~0=~z~0_In-478336322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 19:32:14,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 19:32:14,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-247934168 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-247934168 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-247934168|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-247934168 |ULTIMATE.start_main_#t~ite61_Out-247934168|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-247934168, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-247934168} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-247934168, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-247934168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-247934168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 19:32:14,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1183066272 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1183066272 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1183066272 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1183066272 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1183066272| ~z$w_buff1_used~0_In-1183066272) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1183066272| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1183066272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183066272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1183066272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1183066272} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1183066272|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1183066272, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1183066272, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1183066272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1183066272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 19:32:14,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-212691971 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-212691971 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-212691971| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-212691971| ~z$r_buff0_thd0~0_In-212691971)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-212691971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-212691971} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-212691971|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-212691971, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-212691971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 19:32:14,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In564321326 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In564321326 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In564321326 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In564321326 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out564321326|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In564321326 |ULTIMATE.start_main_#t~ite64_Out564321326|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In564321326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In564321326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In564321326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In564321326} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In564321326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In564321326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In564321326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In564321326, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out564321326|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 19:32:14,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:32:14,969 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_701dae93-cc14-4acb-b437-8e52c5328e61/bin/utaipan/witness.graphml [2019-12-07 19:32:14,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:32:14,970 INFO L168 Benchmark]: Toolchain (without parser) took 202522.48 ms. Allocated memory was 1.0 GB in the beginning and 10.9 GB in the end (delta: 9.8 GB). Free memory was 943.5 MB in the beginning and 5.3 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2019-12-07 19:32:14,970 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:32:14,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:14,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:32:14,971 INFO L168 Benchmark]: Boogie Preprocessor took 27.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:14,971 INFO L168 Benchmark]: RCFGBuilder took 458.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.4 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:14,971 INFO L168 Benchmark]: TraceAbstraction took 201515.21 ms. Allocated memory was 1.1 GB in the beginning and 10.9 GB in the end (delta: 9.7 GB). Free memory was 995.4 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. [2019-12-07 19:32:14,972 INFO L168 Benchmark]: Witness Printer took 79.43 ms. Allocated memory is still 10.9 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:32:14,973 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.42 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 27.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 458.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.4 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 201515.21 ms. Allocated memory was 1.1 GB in the beginning and 10.9 GB in the end (delta: 9.7 GB). Free memory was 995.4 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. * Witness Printer took 79.43 ms. Allocated memory is still 10.9 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 340 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 380 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_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))=0, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_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))=1, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 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 [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 201.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 54.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5643 SDtfs, 8923 SDslu, 13632 SDs, 0 SdLazy, 3820 SolverSat, 306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379318occurred 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: 129.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 895547 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 871 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 181758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...