./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/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 3915ac96bf19657900740412bd5789f6788284da .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:43:55,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:43:55,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:43:55,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:43:55,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:43:55,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:43:55,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:43:55,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:43:55,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:43:55,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:43:55,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:43:55,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:43:55,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:43:55,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:43:55,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:43:55,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:43:55,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:43:55,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:43:55,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:43:55,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:43:55,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:43:55,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:43:55,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:43:55,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:43:55,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:43:55,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:43:55,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:43:55,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:43:55,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:43:55,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:43:55,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:43:55,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:43:55,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:43:55,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:43:55,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:43:55,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:43:55,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:43:55,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:43:55,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:43:55,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:43:55,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:43:55,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:43:55,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:43:55,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:43:55,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:43:55,759 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:43:55,759 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:43:55,760 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:43:55,760 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:43:55,760 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:43:55,760 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:43:55,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:43:55,761 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:43:55,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:43:55,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:43:55,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:43:55,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:43:55,763 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:43:55,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:43:55,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:43:55,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:43:55,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:43:55,763 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_3771fdcb-9617-416c-afc4-cd4d00ae8b35/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 -> 3915ac96bf19657900740412bd5789f6788284da [2019-12-07 20:43:55,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:43:55,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:43:55,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:43:55,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:43:55,873 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:43:55,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_rmo.opt.i [2019-12-07 20:43:55,912 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/data/75d694ed1/0e43dcd5981044548b6664a6c3f00774/FLAG80c2cf322 [2019-12-07 20:43:56,386 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:43:56,387 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/sv-benchmarks/c/pthread-wmm/safe029_rmo.opt.i [2019-12-07 20:43:56,398 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/data/75d694ed1/0e43dcd5981044548b6664a6c3f00774/FLAG80c2cf322 [2019-12-07 20:43:56,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/data/75d694ed1/0e43dcd5981044548b6664a6c3f00774 [2019-12-07 20:43:56,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:43:56,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:43:56,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:43:56,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:43:56,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:43:56,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:43:56" (1/1) ... [2019-12-07 20:43:56,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:56, skipping insertion in model container [2019-12-07 20:43:56,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:43:56" (1/1) ... [2019-12-07 20:43:56,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:43:56,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:43:57,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:43:57,188 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:43:57,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:43:57,272 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:43:57,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57 WrapperNode [2019-12-07 20:43:57,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:43:57,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:43:57,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:43:57,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:43:57,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:43:57,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:43:57,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:43:57,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:43:57,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... [2019-12-07 20:43:57,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:43:57,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:43:57,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:43:57,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:43:57,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/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 20:43:57,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:43:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:43:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:43:57,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:43:57,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:43:57,384 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 20:43:57,704 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:43:57,704 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:43:57,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:43:57 BoogieIcfgContainer [2019-12-07 20:43:57,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:43:57,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:43:57,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:43:57,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:43:57,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:43:56" (1/3) ... [2019-12-07 20:43:57,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e19c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:43:57, skipping insertion in model container [2019-12-07 20:43:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:43:57" (2/3) ... [2019-12-07 20:43:57,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e19c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:43:57, skipping insertion in model container [2019-12-07 20:43:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:43:57" (3/3) ... [2019-12-07 20:43:57,709 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2019-12-07 20:43:57,715 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:43:57,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:43:57,720 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:43:57,720 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:43:57,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:43:57,758 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 20:43:57,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:43:57,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:43:57,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:43:57,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:43:57,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:43:57,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:43:57,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:43:57,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:43:57,781 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-07 20:43:57,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-07 20:43:57,828 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-07 20:43:57,829 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:43:57,837 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 462 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 20:43:57,847 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-07 20:43:57,869 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-07 20:43:57,869 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:43:57,872 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 462 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 20:43:57,880 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-07 20:43:57,881 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:44:00,311 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-07 20:44:00,386 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-07 20:44:00,386 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-07 20:44:00,388 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-07 20:44:00,723 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-07 20:44:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-07 20:44:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:44:00,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:00,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:44:00,729 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-07 20:44:00,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:00,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676278485] [2019-12-07 20:44:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:00,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676278485] [2019-12-07 20:44:00,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:00,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:44:00,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914450807] [2019-12-07 20:44:00,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:00,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:00,901 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-07 20:44:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:01,113 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-07 20:44:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:01,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:44:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:01,178 INFO L225 Difference]: With dead ends: 8560 [2019-12-07 20:44:01,178 INFO L226 Difference]: Without dead ends: 8391 [2019-12-07 20:44:01,179 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 20:44:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-07 20:44:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-07 20:44:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-07 20:44:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-07 20:44:01,497 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-07 20:44:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:01,498 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-07 20:44:01,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-07 20:44:01,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:44:01,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:01,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:01,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-07 20:44:01,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:01,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253202058] [2019-12-07 20:44:01,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:01,591 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 20:44:01,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253202058] [2019-12-07 20:44:01,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:01,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:44:01,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845999057] [2019-12-07 20:44:01,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:44:01,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:44:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:44:01,593 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-07 20:44:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:01,813 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-07 20:44:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:44:01,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:44:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:01,877 INFO L225 Difference]: With dead ends: 13399 [2019-12-07 20:44:01,878 INFO L226 Difference]: Without dead ends: 13392 [2019-12-07 20:44:01,878 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 20:44:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-07 20:44:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-07 20:44:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-07 20:44:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-07 20:44:02,183 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-07 20:44:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:02,184 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-07 20:44:02,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:44:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-07 20:44:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:44:02,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:02,186 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:44:02,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-07 20:44:02,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:02,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517247218] [2019-12-07 20:44:02,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:02,235 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 20:44:02,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517247218] [2019-12-07 20:44:02,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:02,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:44:02,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033377949] [2019-12-07 20:44:02,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:44:02,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:44:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:44:02,236 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-07 20:44:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:02,259 INFO L93 Difference]: Finished difference Result 1949 states and 4516 transitions. [2019-12-07 20:44:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:44:02,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:44:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:02,262 INFO L225 Difference]: With dead ends: 1949 [2019-12-07 20:44:02,262 INFO L226 Difference]: Without dead ends: 1663 [2019-12-07 20:44:02,262 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 20:44:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-12-07 20:44:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2019-12-07 20:44:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-12-07 20:44:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3725 transitions. [2019-12-07 20:44:02,283 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3725 transitions. Word has length 11 [2019-12-07 20:44:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:02,284 INFO L462 AbstractCegarLoop]: Abstraction has 1663 states and 3725 transitions. [2019-12-07 20:44:02,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:44:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3725 transitions. [2019-12-07 20:44:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:44:02,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:02,285 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] [2019-12-07 20:44:02,286 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:02,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1402369775, now seen corresponding path program 1 times [2019-12-07 20:44:02,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:02,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493856886] [2019-12-07 20:44:02,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:02,348 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 20:44:02,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493856886] [2019-12-07 20:44:02,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:02,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:44:02,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239035614] [2019-12-07 20:44:02,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:44:02,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:44:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:44:02,350 INFO L87 Difference]: Start difference. First operand 1663 states and 3725 transitions. Second operand 5 states. [2019-12-07 20:44:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:02,381 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-07 20:44:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:44:02,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 20:44:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:02,383 INFO L225 Difference]: With dead ends: 403 [2019-12-07 20:44:02,383 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 20:44:02,383 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 20:44:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 20:44:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-07 20:44:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 20:44:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-07 20:44:02,389 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-07 20:44:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:02,389 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-07 20:44:02,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:44:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-07 20:44:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:44:02,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:02,391 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] [2019-12-07 20:44:02,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1079059862, now seen corresponding path program 1 times [2019-12-07 20:44:02,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:02,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332512997] [2019-12-07 20:44:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:02,456 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 20:44:02,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332512997] [2019-12-07 20:44:02,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:02,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:44:02,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289987986] [2019-12-07 20:44:02,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:02,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:02,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:02,457 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-07 20:44:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:02,490 INFO L93 Difference]: Finished difference Result 332 states and 605 transitions. [2019-12-07 20:44:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:02,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 20:44:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:02,491 INFO L225 Difference]: With dead ends: 332 [2019-12-07 20:44:02,491 INFO L226 Difference]: Without dead ends: 332 [2019-12-07 20:44:02,491 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 20:44:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-07 20:44:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-07 20:44:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-07 20:44:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 601 transitions. [2019-12-07 20:44:02,497 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 601 transitions. Word has length 52 [2019-12-07 20:44:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:02,498 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 601 transitions. [2019-12-07 20:44:02,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 601 transitions. [2019-12-07 20:44:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:44:02,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:02,500 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] [2019-12-07 20:44:02,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:02,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-07 20:44:02,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:02,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450848396] [2019-12-07 20:44:02,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:02,588 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 20:44:02,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450848396] [2019-12-07 20:44:02,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:02,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:44:02,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645300699] [2019-12-07 20:44:02,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:44:02,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:44:02,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:44:02,590 INFO L87 Difference]: Start difference. First operand 328 states and 601 transitions. Second operand 5 states. [2019-12-07 20:44:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:02,724 INFO L93 Difference]: Finished difference Result 459 states and 837 transitions. [2019-12-07 20:44:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:44:02,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 20:44:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:02,725 INFO L225 Difference]: With dead ends: 459 [2019-12-07 20:44:02,725 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 20:44:02,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:44:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 20:44:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-07 20:44:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-07 20:44:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 692 transitions. [2019-12-07 20:44:02,730 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 692 transitions. Word has length 52 [2019-12-07 20:44:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:02,730 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 692 transitions. [2019-12-07 20:44:02,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:44:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 692 transitions. [2019-12-07 20:44:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:44:02,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:02,731 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] [2019-12-07 20:44:02,731 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-07 20:44:02,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:02,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201333976] [2019-12-07 20:44:02,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:44:02,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201333976] [2019-12-07 20:44:02,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:02,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:44:02,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977749552] [2019-12-07 20:44:02,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:44:02,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:02,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:44:02,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:44:02,814 INFO L87 Difference]: Start difference. First operand 375 states and 692 transitions. Second operand 6 states. [2019-12-07 20:44:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:03,039 INFO L93 Difference]: Finished difference Result 644 states and 1177 transitions. [2019-12-07 20:44:03,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:44:03,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 20:44:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:03,041 INFO L225 Difference]: With dead ends: 644 [2019-12-07 20:44:03,041 INFO L226 Difference]: Without dead ends: 644 [2019-12-07 20:44:03,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:44:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-07 20:44:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 405. [2019-12-07 20:44:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 20:44:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 752 transitions. [2019-12-07 20:44:03,047 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 752 transitions. Word has length 52 [2019-12-07 20:44:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:03,047 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 752 transitions. [2019-12-07 20:44:03,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:44:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 752 transitions. [2019-12-07 20:44:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:44:03,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:03,048 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] [2019-12-07 20:44:03,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-07 20:44:03,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:03,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259690665] [2019-12-07 20:44:03,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:03,111 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 20:44:03,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259690665] [2019-12-07 20:44:03,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:03,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:44:03,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406182411] [2019-12-07 20:44:03,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:44:03,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:03,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:44:03,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:44:03,113 INFO L87 Difference]: Start difference. First operand 405 states and 752 transitions. Second operand 6 states. [2019-12-07 20:44:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:03,310 INFO L93 Difference]: Finished difference Result 622 states and 1139 transitions. [2019-12-07 20:44:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:44:03,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 20:44:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:03,311 INFO L225 Difference]: With dead ends: 622 [2019-12-07 20:44:03,311 INFO L226 Difference]: Without dead ends: 622 [2019-12-07 20:44:03,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:44:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-07 20:44:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 446. [2019-12-07 20:44:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-07 20:44:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 830 transitions. [2019-12-07 20:44:03,317 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 830 transitions. Word has length 52 [2019-12-07 20:44:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:03,317 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 830 transitions. [2019-12-07 20:44:03,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:44:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 830 transitions. [2019-12-07 20:44:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:44:03,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:03,319 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] [2019-12-07 20:44:03,319 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1537444781, now seen corresponding path program 4 times [2019-12-07 20:44:03,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:03,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647582821] [2019-12-07 20:44:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:03,394 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 20:44:03,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647582821] [2019-12-07 20:44:03,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:03,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:44:03,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797474322] [2019-12-07 20:44:03,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:44:03,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:44:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:44:03,396 INFO L87 Difference]: Start difference. First operand 446 states and 830 transitions. Second operand 7 states. [2019-12-07 20:44:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:03,643 INFO L93 Difference]: Finished difference Result 704 states and 1288 transitions. [2019-12-07 20:44:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:44:03,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 20:44:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:03,645 INFO L225 Difference]: With dead ends: 704 [2019-12-07 20:44:03,645 INFO L226 Difference]: Without dead ends: 704 [2019-12-07 20:44:03,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:44:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-07 20:44:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 425. [2019-12-07 20:44:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-07 20:44:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 789 transitions. [2019-12-07 20:44:03,651 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 789 transitions. Word has length 52 [2019-12-07 20:44:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:03,651 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 789 transitions. [2019-12-07 20:44:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:44:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 789 transitions. [2019-12-07 20:44:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:44:03,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:03,652 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] [2019-12-07 20:44:03,652 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:03,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1548250017, now seen corresponding path program 1 times [2019-12-07 20:44:03,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:03,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370932385] [2019-12-07 20:44:03,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:03,776 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 20:44:03,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370932385] [2019-12-07 20:44:03,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:03,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:44:03,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099669143] [2019-12-07 20:44:03,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:44:03,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:03,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:44:03,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:44:03,777 INFO L87 Difference]: Start difference. First operand 425 states and 789 transitions. Second operand 8 states. [2019-12-07 20:44:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:04,096 INFO L93 Difference]: Finished difference Result 716 states and 1278 transitions. [2019-12-07 20:44:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:44:04,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-07 20:44:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:04,097 INFO L225 Difference]: With dead ends: 716 [2019-12-07 20:44:04,097 INFO L226 Difference]: Without dead ends: 716 [2019-12-07 20:44:04,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:44:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-12-07 20:44:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 383. [2019-12-07 20:44:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 20:44:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 695 transitions. [2019-12-07 20:44:04,103 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 695 transitions. Word has length 53 [2019-12-07 20:44:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:04,103 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 695 transitions. [2019-12-07 20:44:04,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:44:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 695 transitions. [2019-12-07 20:44:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:44:04,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:04,104 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] [2019-12-07 20:44:04,104 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1975941905, now seen corresponding path program 2 times [2019-12-07 20:44:04,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:04,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3826601] [2019-12-07 20:44:04,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:04,139 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 20:44:04,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3826601] [2019-12-07 20:44:04,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:04,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:44:04,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693497935] [2019-12-07 20:44:04,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:04,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:04,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:04,141 INFO L87 Difference]: Start difference. First operand 383 states and 695 transitions. Second operand 3 states. [2019-12-07 20:44:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:04,172 INFO L93 Difference]: Finished difference Result 382 states and 693 transitions. [2019-12-07 20:44:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:04,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 20:44:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:04,173 INFO L225 Difference]: With dead ends: 382 [2019-12-07 20:44:04,173 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 20:44:04,173 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 20:44:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 20:44:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 279. [2019-12-07 20:44:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-07 20:44:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 500 transitions. [2019-12-07 20:44:04,177 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 500 transitions. Word has length 53 [2019-12-07 20:44:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:04,177 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 500 transitions. [2019-12-07 20:44:04,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 500 transitions. [2019-12-07 20:44:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:44:04,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:04,178 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] [2019-12-07 20:44:04,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:04,178 INFO L82 PathProgramCache]: Analyzing trace with hash 768058421, now seen corresponding path program 1 times [2019-12-07 20:44:04,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:04,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71144988] [2019-12-07 20:44:04,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:04,210 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 20:44:04,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71144988] [2019-12-07 20:44:04,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:04,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:44:04,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978857422] [2019-12-07 20:44:04,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:44:04,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:44:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:44:04,211 INFO L87 Difference]: Start difference. First operand 279 states and 500 transitions. Second operand 3 states. [2019-12-07 20:44:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:04,220 INFO L93 Difference]: Finished difference Result 275 states and 487 transitions. [2019-12-07 20:44:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:44:04,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 20:44:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:04,220 INFO L225 Difference]: With dead ends: 275 [2019-12-07 20:44:04,220 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 20:44:04,221 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 20:44:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 20:44:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-12-07 20:44:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-12-07 20:44:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 487 transitions. [2019-12-07 20:44:04,225 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 487 transitions. Word has length 53 [2019-12-07 20:44:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:04,225 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 487 transitions. [2019-12-07 20:44:04,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:44:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 487 transitions. [2019-12-07 20:44:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:44:04,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:04,227 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] [2019-12-07 20:44:04,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-07 20:44:04,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:04,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237601253] [2019-12-07 20:44:04,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:04,308 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 20:44:04,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237601253] [2019-12-07 20:44:04,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:44:04,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844692958] [2019-12-07 20:44:04,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:44:04,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:44:04,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:44:04,310 INFO L87 Difference]: Start difference. First operand 275 states and 487 transitions. Second operand 6 states. [2019-12-07 20:44:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:04,353 INFO L93 Difference]: Finished difference Result 479 states and 841 transitions. [2019-12-07 20:44:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:44:04,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-07 20:44:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:04,354 INFO L225 Difference]: With dead ends: 479 [2019-12-07 20:44:04,354 INFO L226 Difference]: Without dead ends: 221 [2019-12-07 20:44:04,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:44:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-07 20:44:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2019-12-07 20:44:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-07 20:44:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 335 transitions. [2019-12-07 20:44:04,357 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 335 transitions. Word has length 54 [2019-12-07 20:44:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:04,357 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 335 transitions. [2019-12-07 20:44:04,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:44:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 335 transitions. [2019-12-07 20:44:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:44:04,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:04,358 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] [2019-12-07 20:44:04,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-07 20:44:04,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194679907] [2019-12-07 20:44:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:04,586 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 20:44:04,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194679907] [2019-12-07 20:44:04,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:04,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 20:44:04,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222322009] [2019-12-07 20:44:04,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:44:04,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:04,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:44:04,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:44:04,588 INFO L87 Difference]: Start difference. First operand 197 states and 335 transitions. Second operand 14 states. [2019-12-07 20:44:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:04,929 INFO L93 Difference]: Finished difference Result 363 states and 608 transitions. [2019-12-07 20:44:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:44:04,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-07 20:44:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:04,930 INFO L225 Difference]: With dead ends: 363 [2019-12-07 20:44:04,930 INFO L226 Difference]: Without dead ends: 331 [2019-12-07 20:44:04,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:44:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-07 20:44:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-07 20:44:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 20:44:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 506 transitions. [2019-12-07 20:44:04,934 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 506 transitions. Word has length 54 [2019-12-07 20:44:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:04,934 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 506 transitions. [2019-12-07 20:44:04,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:44:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 506 transitions. [2019-12-07 20:44:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:44:04,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:04,935 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] [2019-12-07 20:44:04,935 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1111282689, now seen corresponding path program 3 times [2019-12-07 20:44:04,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:04,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633373630] [2019-12-07 20:44:04,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:44:05,116 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 20:44:05,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633373630] [2019-12-07 20:44:05,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:44:05,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 20:44:05,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998853966] [2019-12-07 20:44:05,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:44:05,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:44:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:44:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:44:05,118 INFO L87 Difference]: Start difference. First operand 297 states and 506 transitions. Second operand 14 states. [2019-12-07 20:44:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:44:05,419 INFO L93 Difference]: Finished difference Result 399 states and 659 transitions. [2019-12-07 20:44:05,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 20:44:05,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-07 20:44:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:44:05,420 INFO L225 Difference]: With dead ends: 399 [2019-12-07 20:44:05,420 INFO L226 Difference]: Without dead ends: 367 [2019-12-07 20:44:05,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:44:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-07 20:44:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 305. [2019-12-07 20:44:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 20:44:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 520 transitions. [2019-12-07 20:44:05,424 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 520 transitions. Word has length 54 [2019-12-07 20:44:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:44:05,424 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 520 transitions. [2019-12-07 20:44:05,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:44:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 520 transitions. [2019-12-07 20:44:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:44:05,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:44:05,425 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] [2019-12-07 20:44:05,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:44:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:44:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 4 times [2019-12-07 20:44:05,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:44:05,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173542454] [2019-12-07 20:44:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:44:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:44:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:44:05,493 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:44:05,493 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:44:05,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2483~0.base_19| 4)) (= v_~x$r_buff0_thd0~0_298 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19| 1)) (= 0 |v_ULTIMATE.start_main_~#t2483~0.offset_16|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19|) |v_ULTIMATE.start_main_~#t2483~0.offset_16| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2483~0.base_19|) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_16|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_~#t2483~0.base=|v_ULTIMATE.start_main_~#t2483~0.base_19|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_20|, ULTIMATE.start_main_~#t2483~0.offset=|v_ULTIMATE.start_main_~#t2483~0.offset_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2484~0.offset, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t2483~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2483~0.offset, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 20:44:05,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2484~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2484~0.offset_9|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2484~0.base_10|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10|) |v_ULTIMATE.start_main_~#t2484~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_10|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2484~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-07 20:44:05,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= ~x$w_buff0_used~0_In-75425476 ~x$w_buff1_used~0_Out-75425476) (= 2 ~x$w_buff0~0_Out-75425476) (= ~x$w_buff0~0_In-75425476 ~x$w_buff1~0_Out-75425476) (= |P1Thread1of1ForFork1_#in~arg.offset_In-75425476| P1Thread1of1ForFork1_~arg.offset_Out-75425476) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-75425476 0)) (= P1Thread1of1ForFork1_~arg.base_Out-75425476 |P1Thread1of1ForFork1_#in~arg.base_In-75425476|) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-75425476 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-75425476|) (= (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out-75425476 256))) (not (= (mod ~x$w_buff1_used~0_Out-75425476 256) 0)))) 1 0) |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-75425476|) (= 1 ~x$w_buff0_used~0_Out-75425476)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-75425476, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-75425476|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-75425476|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75425476} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-75425476, ~x$w_buff0~0=~x$w_buff0~0_Out-75425476, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-75425476, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-75425476|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-75425476, ~x$w_buff1~0=~x$w_buff1~0_Out-75425476, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-75425476|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-75425476|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-75425476, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-75425476} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 20:44:05,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In542598042 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In542598042 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out542598042| |P0Thread1of1ForFork0_#t~ite3_Out542598042|))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In542598042 |P0Thread1of1ForFork0_#t~ite3_Out542598042|) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~x~0_In542598042 |P0Thread1of1ForFork0_#t~ite3_Out542598042|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In542598042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In542598042, ~x~0=~x~0_In542598042} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out542598042|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out542598042|, ~x$w_buff1~0=~x$w_buff1~0_In542598042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In542598042, ~x~0=~x~0_In542598042} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 20:44:05,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In536080526 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In536080526 256)))) (or (and (= ~x$w_buff0_used~0_In536080526 |P1Thread1of1ForFork1_#t~ite11_Out536080526|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out536080526|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In536080526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out536080526|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In536080526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 20:44:05,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1431836944 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1431836944 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1431836944| ~x$w_buff0_used~0_In-1431836944) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1431836944| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1431836944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1431836944} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1431836944|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1431836944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1431836944} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:44:05,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1323070378 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1323070378 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1323070378 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1323070378 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1323070378| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1323070378| ~x$w_buff1_used~0_In-1323070378) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1323070378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1323070378, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1323070378|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1323070378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1323070378, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:44:05,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1010276006 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1010276006 256)))) (or (and (= ~x$r_buff0_thd1~0_In1010276006 |P0Thread1of1ForFork0_#t~ite7_Out1010276006|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1010276006|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1010276006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1010276006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1010276006, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1010276006|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1010276006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 20:44:05,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In388190703 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In388190703 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In388190703 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In388190703 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out388190703| ~x$r_buff1_thd1~0_In388190703) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out388190703| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In388190703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In388190703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In388190703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388190703} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In388190703, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out388190703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In388190703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In388190703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388190703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:44:05,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_34|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 20:44:05,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1923786861 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1923786861 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1923786861 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1923786861 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1923786861|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1923786861 |P1Thread1of1ForFork1_#t~ite12_Out1923786861|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1923786861, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1923786861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1923786861, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1923786861|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1923786861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:44:05,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2103668030 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In-2103668030 ~x$r_buff0_thd2~0_Out-2103668030)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2103668030 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-2103668030) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2103668030|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 20:44:05,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In707603331 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In707603331 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In707603331 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In707603331 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out707603331|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In707603331 |P1Thread1of1ForFork1_#t~ite14_Out707603331|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In707603331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In707603331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In707603331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In707603331, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out707603331|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 20:44:05,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 20:44:05,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:44:05,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In269876670 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In269876670 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In269876670 |ULTIMATE.start_main_#t~ite17_Out269876670|)) (and (= |ULTIMATE.start_main_#t~ite17_Out269876670| ~x~0_In269876670) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In269876670, ~x$w_buff1_used~0=~x$w_buff1_used~0_In269876670, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In269876670, ~x~0=~x~0_In269876670} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out269876670|, ~x$w_buff1~0=~x$w_buff1~0_In269876670, ~x$w_buff1_used~0=~x$w_buff1_used~0_In269876670, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In269876670, ~x~0=~x~0_In269876670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-07 20:44:05,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-07 20:44:05,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-497456850 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-497456850 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-497456850 |ULTIMATE.start_main_#t~ite19_Out-497456850|)) (and (= |ULTIMATE.start_main_#t~ite19_Out-497456850| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-497456850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497456850} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-497456850, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-497456850|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497456850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 20:44:05,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-73836390 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-73836390 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-73836390 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-73836390 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-73836390|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-73836390| ~x$w_buff1_used~0_In-73836390) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-73836390|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 20:44:05,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1129319347 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1129319347 256)))) (or (and (= ~x$r_buff0_thd0~0_In-1129319347 |ULTIMATE.start_main_#t~ite21_Out-1129319347|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1129319347|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1129319347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1129319347, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1129319347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 20:44:05,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1363827512 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1363827512 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1363827512 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1363827512 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1363827512| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out-1363827512| ~x$r_buff1_thd0~0_In-1363827512) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1363827512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1363827512} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1363827512, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1363827512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1363827512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 20:44:05,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In770114952 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out770114952| |ULTIMATE.start_main_#t~ite37_Out770114952|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In770114952 256)))) (or (= (mod ~x$w_buff0_used~0_In770114952 256) 0) (and (= (mod ~x$r_buff1_thd0~0_In770114952 256) 0) .cse0) (and (= (mod ~x$w_buff1_used~0_In770114952 256) 0) .cse0))) .cse1 (= ~x$w_buff1_used~0_In770114952 |ULTIMATE.start_main_#t~ite37_Out770114952|)) (and (= ~x$w_buff1_used~0_In770114952 |ULTIMATE.start_main_#t~ite38_Out770114952|) (= |ULTIMATE.start_main_#t~ite37_In770114952| |ULTIMATE.start_main_#t~ite37_Out770114952|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In770114952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In770114952, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In770114952|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In770114952, ~weak$$choice2~0=~weak$$choice2~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In770114952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In770114952, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out770114952|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out770114952|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In770114952, ~weak$$choice2~0=~weak$$choice2~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 20:44:05,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 20:44:05,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:44:05,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 20:44:05,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:44:05 BasicIcfg [2019-12-07 20:44:05,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:44:05,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:44:05,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:44:05,547 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:44:05,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:43:57" (3/4) ... [2019-12-07 20:44:05,548 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:44:05,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2483~0.base_19| 4)) (= v_~x$r_buff0_thd0~0_298 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19| 1)) (= 0 |v_ULTIMATE.start_main_~#t2483~0.offset_16|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2483~0.base_19|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2483~0.base_19|) |v_ULTIMATE.start_main_~#t2483~0.offset_16| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2483~0.base_19|) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_16|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_~#t2483~0.base=|v_ULTIMATE.start_main_~#t2483~0.base_19|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_20|, ULTIMATE.start_main_~#t2483~0.offset=|v_ULTIMATE.start_main_~#t2483~0.offset_16|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2484~0.offset, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t2483~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2483~0.offset, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 20:44:05,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2484~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2484~0.offset_9|) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2484~0.base_10|) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2484~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2484~0.base_10|) |v_ULTIMATE.start_main_~#t2484~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2484~0.base=|v_ULTIMATE.start_main_~#t2484~0.base_10|, ULTIMATE.start_main_~#t2484~0.offset=|v_ULTIMATE.start_main_~#t2484~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2484~0.base, ULTIMATE.start_main_~#t2484~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-07 20:44:05,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= ~x$w_buff0_used~0_In-75425476 ~x$w_buff1_used~0_Out-75425476) (= 2 ~x$w_buff0~0_Out-75425476) (= ~x$w_buff0~0_In-75425476 ~x$w_buff1~0_Out-75425476) (= |P1Thread1of1ForFork1_#in~arg.offset_In-75425476| P1Thread1of1ForFork1_~arg.offset_Out-75425476) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-75425476 0)) (= P1Thread1of1ForFork1_~arg.base_Out-75425476 |P1Thread1of1ForFork1_#in~arg.base_In-75425476|) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-75425476 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-75425476|) (= (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out-75425476 256))) (not (= (mod ~x$w_buff1_used~0_Out-75425476 256) 0)))) 1 0) |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-75425476|) (= 1 ~x$w_buff0_used~0_Out-75425476)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-75425476, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-75425476|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-75425476|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75425476} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-75425476, ~x$w_buff0~0=~x$w_buff0~0_Out-75425476, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-75425476, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-75425476|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-75425476, ~x$w_buff1~0=~x$w_buff1~0_Out-75425476, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-75425476|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-75425476|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-75425476, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-75425476} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 20:44:05,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In542598042 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In542598042 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out542598042| |P0Thread1of1ForFork0_#t~ite3_Out542598042|))) (or (and .cse0 (not .cse1) (= ~x$w_buff1~0_In542598042 |P0Thread1of1ForFork0_#t~ite3_Out542598042|) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~x~0_In542598042 |P0Thread1of1ForFork0_#t~ite3_Out542598042|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In542598042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In542598042, ~x~0=~x~0_In542598042} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out542598042|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out542598042|, ~x$w_buff1~0=~x$w_buff1~0_In542598042, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542598042, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In542598042, ~x~0=~x~0_In542598042} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 20:44:05,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In536080526 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In536080526 256)))) (or (and (= ~x$w_buff0_used~0_In536080526 |P1Thread1of1ForFork1_#t~ite11_Out536080526|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out536080526|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In536080526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out536080526|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In536080526, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536080526} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 20:44:05,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1431836944 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1431836944 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1431836944| ~x$w_buff0_used~0_In-1431836944) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1431836944| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1431836944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1431836944} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1431836944|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1431836944, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1431836944} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:44:05,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1323070378 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1323070378 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1323070378 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1323070378 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1323070378| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1323070378| ~x$w_buff1_used~0_In-1323070378) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1323070378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1323070378, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1323070378|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1323070378, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1323070378, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1323070378, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1323070378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:44:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1010276006 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1010276006 256)))) (or (and (= ~x$r_buff0_thd1~0_In1010276006 |P0Thread1of1ForFork0_#t~ite7_Out1010276006|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1010276006|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1010276006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1010276006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1010276006, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1010276006|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1010276006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 20:44:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In388190703 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In388190703 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In388190703 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In388190703 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out388190703| ~x$r_buff1_thd1~0_In388190703) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out388190703| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In388190703, ~x$w_buff1_used~0=~x$w_buff1_used~0_In388190703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In388190703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388190703} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In388190703, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out388190703|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In388190703, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In388190703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388190703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:44:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_34|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 20:44:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1923786861 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1923786861 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1923786861 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1923786861 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1923786861|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1923786861 |P1Thread1of1ForFork1_#t~ite12_Out1923786861|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1923786861, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1923786861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1923786861, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1923786861, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1923786861|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1923786861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1923786861} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:44:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2103668030 256) 0)) (.cse0 (= ~x$r_buff0_thd2~0_In-2103668030 ~x$r_buff0_thd2~0_Out-2103668030)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2103668030 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-2103668030) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2103668030|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2103668030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2103668030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 20:44:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In707603331 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In707603331 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In707603331 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In707603331 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out707603331|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In707603331 |P1Thread1of1ForFork1_#t~ite14_Out707603331|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In707603331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In707603331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In707603331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In707603331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In707603331, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out707603331|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707603331} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In269876670 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In269876670 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In269876670 |ULTIMATE.start_main_#t~ite17_Out269876670|)) (and (= |ULTIMATE.start_main_#t~ite17_Out269876670| ~x~0_In269876670) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In269876670, ~x$w_buff1_used~0=~x$w_buff1_used~0_In269876670, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In269876670, ~x~0=~x~0_In269876670} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out269876670|, ~x$w_buff1~0=~x$w_buff1~0_In269876670, ~x$w_buff1_used~0=~x$w_buff1_used~0_In269876670, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In269876670, ~x~0=~x~0_In269876670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-497456850 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-497456850 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-497456850 |ULTIMATE.start_main_#t~ite19_Out-497456850|)) (and (= |ULTIMATE.start_main_#t~ite19_Out-497456850| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-497456850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497456850} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-497456850, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-497456850|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497456850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-73836390 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-73836390 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-73836390 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-73836390 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-73836390|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-73836390| ~x$w_buff1_used~0_In-73836390) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-73836390, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73836390, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-73836390|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-73836390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73836390} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 20:44:05,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1129319347 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1129319347 256)))) (or (and (= ~x$r_buff0_thd0~0_In-1129319347 |ULTIMATE.start_main_#t~ite21_Out-1129319347|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1129319347|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1129319347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1129319347, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1129319347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1129319347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 20:44:05,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1363827512 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1363827512 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1363827512 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1363827512 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1363827512| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out-1363827512| ~x$r_buff1_thd0~0_In-1363827512) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1363827512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1363827512} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1363827512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1363827512, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1363827512, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1363827512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1363827512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 20:44:05,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In770114952 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out770114952| |ULTIMATE.start_main_#t~ite37_Out770114952|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In770114952 256)))) (or (= (mod ~x$w_buff0_used~0_In770114952 256) 0) (and (= (mod ~x$r_buff1_thd0~0_In770114952 256) 0) .cse0) (and (= (mod ~x$w_buff1_used~0_In770114952 256) 0) .cse0))) .cse1 (= ~x$w_buff1_used~0_In770114952 |ULTIMATE.start_main_#t~ite37_Out770114952|)) (and (= ~x$w_buff1_used~0_In770114952 |ULTIMATE.start_main_#t~ite38_Out770114952|) (= |ULTIMATE.start_main_#t~ite37_In770114952| |ULTIMATE.start_main_#t~ite37_Out770114952|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In770114952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In770114952, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In770114952|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In770114952, ~weak$$choice2~0=~weak$$choice2~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In770114952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In770114952, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out770114952|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out770114952|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In770114952, ~weak$$choice2~0=~weak$$choice2~0_In770114952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In770114952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 20:44:05,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 20:44:05,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:44:05,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 20:44:05,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3771fdcb-9617-416c-afc4-cd4d00ae8b35/bin/utaipan/witness.graphml [2019-12-07 20:44:05,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:44:05,604 INFO L168 Benchmark]: Toolchain (without parser) took 8705.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.1 MB). Free memory was 940.8 MB in the beginning and 1.3 GB in the end (delta: -330.1 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:05,605 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:44:05,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:05,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.87 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 20:44:05,605 INFO L168 Benchmark]: Boogie Preprocessor took 24.98 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 20:44:05,606 INFO L168 Benchmark]: RCFGBuilder took 366.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:05,606 INFO L168 Benchmark]: TraceAbstraction took 7840.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -267.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:05,606 INFO L168 Benchmark]: Witness Printer took 56.97 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:44:05,608 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -132.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.98 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 366.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7840.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -267.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Witness Printer took 56.97 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1483 SDtfs, 1294 SDslu, 3853 SDs, 0 SdLazy, 2511 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 31 SyntacticMatches, 15 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11787occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 2978 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 111388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...