./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.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_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/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 4b58e06e0ff3c6a470a6b0069b0c1a47cdc822d5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 12:55:39,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:55:39,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:55:39,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:55:39,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:55:39,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:55:39,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:55:39,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:55:39,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:55:39,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:55:39,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:55:39,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:55:39,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:55:39,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:55:39,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:55:39,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:55:39,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:55:39,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:55:39,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:55:39,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:55:39,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:55:39,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:55:39,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:55:39,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:55:39,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:55:39,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:55:39,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:55:39,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:55:39,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:55:39,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:55:39,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:55:39,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:55:39,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:55:39,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:55:39,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:55:39,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:55:39,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:55:39,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:55:39,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:55:39,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:55:39,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:55:39,599 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:55:39,609 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:55:39,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:55:39,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:55:39,610 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:55:39,610 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:55:39,610 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:55:39,610 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:55:39,611 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:55:39,611 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:55:39,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:55:39,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:55:39,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:55:39,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:55:39,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:55:39,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:55:39,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:55:39,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:55:39,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:55:39,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:55:39,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:55:39,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:55:39,615 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/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 -> 4b58e06e0ff3c6a470a6b0069b0c1a47cdc822d5 [2019-12-07 12:55:39,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:55:39,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:55:39,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:55:39,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:55:39,730 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:55:39,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i [2019-12-07 12:55:39,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/data/61d97b715/b36bfbfa39b2478d9aeb611ee8de79e2/FLAG6e8d6bc2a [2019-12-07 12:55:40,271 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:55:40,272 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/sv-benchmarks/c/pthread-wmm/rfi008_tso.opt.i [2019-12-07 12:55:40,283 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/data/61d97b715/b36bfbfa39b2478d9aeb611ee8de79e2/FLAG6e8d6bc2a [2019-12-07 12:55:40,291 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/data/61d97b715/b36bfbfa39b2478d9aeb611ee8de79e2 [2019-12-07 12:55:40,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:55:40,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:55:40,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:55:40,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:55:40,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:55:40,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca39364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40, skipping insertion in model container [2019-12-07 12:55:40,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:55:40,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:55:40,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:55:40,588 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:55:40,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:55:40,679 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:55:40,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40 WrapperNode [2019-12-07 12:55:40,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:55:40,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:55:40,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:55:40,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:55:40,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:55:40,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:55:40,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:55:40,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:55:40,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... [2019-12-07 12:55:40,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:55:40,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:55:40,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:55:40,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:55:40,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/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 12:55:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:55:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:55:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:55:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:55:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:55:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:55:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:55:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:55:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:55:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:55:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:55:40,798 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 12:55:41,181 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:55:41,182 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:55:41,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:55:41 BoogieIcfgContainer [2019-12-07 12:55:41,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:55:41,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:55:41,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:55:41,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:55:41,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:55:40" (1/3) ... [2019-12-07 12:55:41,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2d8514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:55:41, skipping insertion in model container [2019-12-07 12:55:41,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:40" (2/3) ... [2019-12-07 12:55:41,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2d8514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:55:41, skipping insertion in model container [2019-12-07 12:55:41,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:55:41" (3/3) ... [2019-12-07 12:55:41,187 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_tso.opt.i [2019-12-07 12:55:41,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:55:41,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:55:41,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:55:41,199 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:55:41,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,236 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,236 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,236 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:55:41,260 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:55:41,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:55:41,272 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:55:41,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:55:41,272 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:55:41,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:55:41,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:55:41,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:55:41,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:55:41,284 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 12:55:41,285 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 12:55:41,343 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 12:55:41,343 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:55:41,354 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 12:55:41,373 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 12:55:41,404 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 12:55:41,405 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:55:41,412 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 12:55:41,433 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 12:55:41,434 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:55:44,145 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 12:55:44,306 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:55:44,416 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-07 12:55:44,416 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 12:55:44,418 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-07 12:55:45,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-07 12:55:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-07 12:55:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:55:45,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:45,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:55:45,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:45,690 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-07 12:55:45,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:45,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143240741] [2019-12-07 12:55:45,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:45,829 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 12:55:45,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143240741] [2019-12-07 12:55:45,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:45,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:55:45,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635023364] [2019-12-07 12:55:45,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:45,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:45,845 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-07 12:55:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:46,134 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-07 12:55:46,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:46,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:55:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:46,270 INFO L225 Difference]: With dead ends: 25080 [2019-12-07 12:55:46,271 INFO L226 Difference]: Without dead ends: 23470 [2019-12-07 12:55:46,271 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 12:55:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-07 12:55:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-07 12:55:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-07 12:55:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-07 12:55:47,173 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-07 12:55:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:47,173 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-07 12:55:47,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-07 12:55:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:55:47,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:47,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:47,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:47,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-07 12:55:47,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:47,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544466373] [2019-12-07 12:55:47,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:47,234 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 12:55:47,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544466373] [2019-12-07 12:55:47,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:47,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:47,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511389443] [2019-12-07 12:55:47,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:47,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:47,236 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-07 12:55:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:47,649 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-12-07 12:55:47,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:47,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:55:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:47,779 INFO L225 Difference]: With dead ends: 36446 [2019-12-07 12:55:47,780 INFO L226 Difference]: Without dead ends: 36430 [2019-12-07 12:55:47,780 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 12:55:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-12-07 12:55:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-12-07 12:55:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-12-07 12:55:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-12-07 12:55:48,841 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-12-07 12:55:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:48,841 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-12-07 12:55:48,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-12-07 12:55:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:55:48,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:48,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:48,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-07 12:55:48,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:48,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978222062] [2019-12-07 12:55:48,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:48,894 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 12:55:48,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978222062] [2019-12-07 12:55:48,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:48,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:48,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061987082] [2019-12-07 12:55:48,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:48,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:48,896 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 4 states. [2019-12-07 12:55:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:49,201 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-12-07 12:55:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:49,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:55:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:49,287 INFO L225 Difference]: With dead ends: 46394 [2019-12-07 12:55:49,287 INFO L226 Difference]: Without dead ends: 46379 [2019-12-07 12:55:49,287 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 12:55:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-12-07 12:55:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-12-07 12:55:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-12-07 12:55:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-12-07 12:55:50,316 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-12-07 12:55:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:50,317 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-12-07 12:55:50,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-12-07 12:55:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:55:50,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:50,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:50,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-07 12:55:50,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:50,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144665922] [2019-12-07 12:55:50,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:50,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 12:55:50,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144665922] [2019-12-07 12:55:50,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:50,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:50,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116707905] [2019-12-07 12:55:50,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:50,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:50,350 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 3 states. [2019-12-07 12:55:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:50,603 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-12-07 12:55:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:50,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:55:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:50,718 INFO L225 Difference]: With dead ends: 67890 [2019-12-07 12:55:50,718 INFO L226 Difference]: Without dead ends: 67890 [2019-12-07 12:55:50,719 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 12:55:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-12-07 12:55:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-12-07 12:55:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-12-07 12:55:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-12-07 12:55:52,285 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-12-07 12:55:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:52,285 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-12-07 12:55:52,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-12-07 12:55:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:55:52,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:52,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:52,290 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-12-07 12:55:52,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:52,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030787679] [2019-12-07 12:55:52,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:52,342 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 12:55:52,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030787679] [2019-12-07 12:55:52,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:52,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:52,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063011767] [2019-12-07 12:55:52,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:52,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:52,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:52,344 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 4 states. [2019-12-07 12:55:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:52,388 INFO L93 Difference]: Finished difference Result 9507 states and 25746 transitions. [2019-12-07 12:55:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:55:52,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:55:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:52,394 INFO L225 Difference]: With dead ends: 9507 [2019-12-07 12:55:52,394 INFO L226 Difference]: Without dead ends: 5931 [2019-12-07 12:55:52,395 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 12:55:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2019-12-07 12:55:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5931. [2019-12-07 12:55:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-07 12:55:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13936 transitions. [2019-12-07 12:55:52,450 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13936 transitions. Word has length 16 [2019-12-07 12:55:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:52,450 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13936 transitions. [2019-12-07 12:55:52,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13936 transitions. [2019-12-07 12:55:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:55:52,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:52,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:52,451 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:52,451 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-07 12:55:52,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:52,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175692002] [2019-12-07 12:55:52,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:52,490 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 12:55:52,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175692002] [2019-12-07 12:55:52,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:52,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:52,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838935576] [2019-12-07 12:55:52,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:52,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:52,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:52,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:52,491 INFO L87 Difference]: Start difference. First operand 5931 states and 13936 transitions. Second operand 4 states. [2019-12-07 12:55:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:52,644 INFO L93 Difference]: Finished difference Result 7446 states and 17184 transitions. [2019-12-07 12:55:52,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:52,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 12:55:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:52,650 INFO L225 Difference]: With dead ends: 7446 [2019-12-07 12:55:52,650 INFO L226 Difference]: Without dead ends: 7418 [2019-12-07 12:55:52,650 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 12:55:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-12-07 12:55:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 5909. [2019-12-07 12:55:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-12-07 12:55:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 13876 transitions. [2019-12-07 12:55:52,709 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 13876 transitions. Word has length 17 [2019-12-07 12:55:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:52,709 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 13876 transitions. [2019-12-07 12:55:52,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 13876 transitions. [2019-12-07 12:55:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:55:52,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:52,713 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] [2019-12-07 12:55:52,713 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2019815131, now seen corresponding path program 1 times [2019-12-07 12:55:52,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:52,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023391559] [2019-12-07 12:55:52,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:52,768 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 12:55:52,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023391559] [2019-12-07 12:55:52,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:52,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:52,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307981317] [2019-12-07 12:55:52,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:52,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:52,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:52,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:52,770 INFO L87 Difference]: Start difference. First operand 5909 states and 13876 transitions. Second operand 5 states. [2019-12-07 12:55:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:53,030 INFO L93 Difference]: Finished difference Result 8033 states and 18356 transitions. [2019-12-07 12:55:53,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:55:53,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:55:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:53,037 INFO L225 Difference]: With dead ends: 8033 [2019-12-07 12:55:53,037 INFO L226 Difference]: Without dead ends: 8032 [2019-12-07 12:55:53,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:55:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-12-07 12:55:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7392. [2019-12-07 12:55:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7392 states. [2019-12-07 12:55:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 17086 transitions. [2019-12-07 12:55:53,118 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 17086 transitions. Word has length 28 [2019-12-07 12:55:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:53,118 INFO L462 AbstractCegarLoop]: Abstraction has 7392 states and 17086 transitions. [2019-12-07 12:55:53,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 17086 transitions. [2019-12-07 12:55:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:55:53,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:53,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:53,124 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1401908326, now seen corresponding path program 1 times [2019-12-07 12:55:53,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672264904] [2019-12-07 12:55:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:53,154 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 12:55:53,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672264904] [2019-12-07 12:55:53,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:53,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:53,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938478582] [2019-12-07 12:55:53,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:53,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:53,155 INFO L87 Difference]: Start difference. First operand 7392 states and 17086 transitions. Second operand 3 states. [2019-12-07 12:55:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:53,204 INFO L93 Difference]: Finished difference Result 7931 states and 17358 transitions. [2019-12-07 12:55:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:53,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:55:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:53,210 INFO L225 Difference]: With dead ends: 7931 [2019-12-07 12:55:53,210 INFO L226 Difference]: Without dead ends: 7931 [2019-12-07 12:55:53,210 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 12:55:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-12-07 12:55:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7375. [2019-12-07 12:55:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-12-07 12:55:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16200 transitions. [2019-12-07 12:55:53,283 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16200 transitions. Word has length 31 [2019-12-07 12:55:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:53,283 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 16200 transitions. [2019-12-07 12:55:53,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16200 transitions. [2019-12-07 12:55:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:55:53,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:53,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:53,289 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1511424135, now seen corresponding path program 1 times [2019-12-07 12:55:53,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:53,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016016867] [2019-12-07 12:55:53,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:53,342 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 12:55:53,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016016867] [2019-12-07 12:55:53,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:53,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:55:53,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535189403] [2019-12-07 12:55:53,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:53,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:53,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:53,343 INFO L87 Difference]: Start difference. First operand 7375 states and 16200 transitions. Second operand 5 states. [2019-12-07 12:55:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:53,377 INFO L93 Difference]: Finished difference Result 4784 states and 10410 transitions. [2019-12-07 12:55:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:53,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 12:55:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:53,380 INFO L225 Difference]: With dead ends: 4784 [2019-12-07 12:55:53,380 INFO L226 Difference]: Without dead ends: 4500 [2019-12-07 12:55:53,380 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 12:55:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2019-12-07 12:55:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3777. [2019-12-07 12:55:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3777 states. [2019-12-07 12:55:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 3777 states and 8426 transitions. [2019-12-07 12:55:53,414 INFO L78 Accepts]: Start accepts. Automaton has 3777 states and 8426 transitions. Word has length 33 [2019-12-07 12:55:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:53,415 INFO L462 AbstractCegarLoop]: Abstraction has 3777 states and 8426 transitions. [2019-12-07 12:55:53,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 8426 transitions. [2019-12-07 12:55:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 12:55:53,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:53,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:53,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1959930181, now seen corresponding path program 1 times [2019-12-07 12:55:53,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:53,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149756677] [2019-12-07 12:55:53,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:53,490 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 12:55:53,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149756677] [2019-12-07 12:55:53,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:53,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:55:53,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247389864] [2019-12-07 12:55:53,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:53,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:53,492 INFO L87 Difference]: Start difference. First operand 3777 states and 8426 transitions. Second operand 5 states. [2019-12-07 12:55:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:53,704 INFO L93 Difference]: Finished difference Result 4457 states and 9747 transitions. [2019-12-07 12:55:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:53,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 12:55:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:53,708 INFO L225 Difference]: With dead ends: 4457 [2019-12-07 12:55:53,708 INFO L226 Difference]: Without dead ends: 4457 [2019-12-07 12:55:53,708 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 12:55:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2019-12-07 12:55:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4205. [2019-12-07 12:55:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2019-12-07 12:55:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 9290 transitions. [2019-12-07 12:55:53,745 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 9290 transitions. Word has length 58 [2019-12-07 12:55:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:53,746 INFO L462 AbstractCegarLoop]: Abstraction has 4205 states and 9290 transitions. [2019-12-07 12:55:53,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 9290 transitions. [2019-12-07 12:55:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 12:55:53,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:53,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:53,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2128975279, now seen corresponding path program 2 times [2019-12-07 12:55:53,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:53,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216684056] [2019-12-07 12:55:53,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:53,794 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 12:55:53,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216684056] [2019-12-07 12:55:53,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:53,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:55:53,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334577155] [2019-12-07 12:55:53,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:53,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:53,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:53,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:53,795 INFO L87 Difference]: Start difference. First operand 4205 states and 9290 transitions. Second operand 3 states. [2019-12-07 12:55:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:53,807 INFO L93 Difference]: Finished difference Result 4204 states and 9288 transitions. [2019-12-07 12:55:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:53,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 12:55:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:53,811 INFO L225 Difference]: With dead ends: 4204 [2019-12-07 12:55:53,811 INFO L226 Difference]: Without dead ends: 4204 [2019-12-07 12:55:53,811 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 12:55:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2019-12-07 12:55:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 4009. [2019-12-07 12:55:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2019-12-07 12:55:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 8923 transitions. [2019-12-07 12:55:53,850 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 8923 transitions. Word has length 58 [2019-12-07 12:55:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:53,850 INFO L462 AbstractCegarLoop]: Abstraction has 4009 states and 8923 transitions. [2019-12-07 12:55:53,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 8923 transitions. [2019-12-07 12:55:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:55:53,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:53,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:53,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1153297112, now seen corresponding path program 1 times [2019-12-07 12:55:53,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:53,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755765992] [2019-12-07 12:55:53,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:53,921 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 12:55:53,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755765992] [2019-12-07 12:55:53,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:53,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:55:53,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688991873] [2019-12-07 12:55:53,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:53,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:53,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:53,922 INFO L87 Difference]: Start difference. First operand 4009 states and 8923 transitions. Second operand 4 states. [2019-12-07 12:55:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:54,030 INFO L93 Difference]: Finished difference Result 4395 states and 9604 transitions. [2019-12-07 12:55:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:55:54,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:55:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:54,033 INFO L225 Difference]: With dead ends: 4395 [2019-12-07 12:55:54,033 INFO L226 Difference]: Without dead ends: 4395 [2019-12-07 12:55:54,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2019-12-07 12:55:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 4259. [2019-12-07 12:55:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2019-12-07 12:55:54,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 9328 transitions. [2019-12-07 12:55:54,073 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 9328 transitions. Word has length 59 [2019-12-07 12:55:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:54,073 INFO L462 AbstractCegarLoop]: Abstraction has 4259 states and 9328 transitions. [2019-12-07 12:55:54,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 9328 transitions. [2019-12-07 12:55:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:55:54,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:54,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:54,078 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash -848544, now seen corresponding path program 2 times [2019-12-07 12:55:54,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:54,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252514716] [2019-12-07 12:55:54,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:54,171 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 12:55:54,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252514716] [2019-12-07 12:55:54,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:54,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:55:54,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497575186] [2019-12-07 12:55:54,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:54,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:54,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:54,172 INFO L87 Difference]: Start difference. First operand 4259 states and 9328 transitions. Second operand 6 states. [2019-12-07 12:55:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:54,419 INFO L93 Difference]: Finished difference Result 4589 states and 9933 transitions. [2019-12-07 12:55:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:54,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 12:55:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:54,422 INFO L225 Difference]: With dead ends: 4589 [2019-12-07 12:55:54,422 INFO L226 Difference]: Without dead ends: 4589 [2019-12-07 12:55:54,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:55:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2019-12-07 12:55:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4343. [2019-12-07 12:55:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-12-07 12:55:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 9461 transitions. [2019-12-07 12:55:54,460 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 9461 transitions. Word has length 59 [2019-12-07 12:55:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:54,460 INFO L462 AbstractCegarLoop]: Abstraction has 4343 states and 9461 transitions. [2019-12-07 12:55:54,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 9461 transitions. [2019-12-07 12:55:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:55:54,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:54,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:54,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1198603708, now seen corresponding path program 3 times [2019-12-07 12:55:54,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:54,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022219024] [2019-12-07 12:55:54,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:54,533 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 12:55:54,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022219024] [2019-12-07 12:55:54,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:54,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:55:54,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595088473] [2019-12-07 12:55:54,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:54,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:54,534 INFO L87 Difference]: Start difference. First operand 4343 states and 9461 transitions. Second operand 6 states. [2019-12-07 12:55:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:54,854 INFO L93 Difference]: Finished difference Result 5427 states and 11703 transitions. [2019-12-07 12:55:54,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:55:54,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 12:55:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:54,859 INFO L225 Difference]: With dead ends: 5427 [2019-12-07 12:55:54,859 INFO L226 Difference]: Without dead ends: 5427 [2019-12-07 12:55:54,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:55:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5427 states. [2019-12-07 12:55:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5427 to 4482. [2019-12-07 12:55:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4482 states. [2019-12-07 12:55:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 9747 transitions. [2019-12-07 12:55:54,904 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 9747 transitions. Word has length 59 [2019-12-07 12:55:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:54,905 INFO L462 AbstractCegarLoop]: Abstraction has 4482 states and 9747 transitions. [2019-12-07 12:55:54,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 9747 transitions. [2019-12-07 12:55:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:55:54,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:54,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:54,910 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1500804762, now seen corresponding path program 4 times [2019-12-07 12:55:54,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:54,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563028302] [2019-12-07 12:55:54,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:54,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563028302] [2019-12-07 12:55:54,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:54,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:55:54,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387758380] [2019-12-07 12:55:54,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:54,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:54,957 INFO L87 Difference]: Start difference. First operand 4482 states and 9747 transitions. Second operand 5 states. [2019-12-07 12:55:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:55,091 INFO L93 Difference]: Finished difference Result 5295 states and 11298 transitions. [2019-12-07 12:55:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:55,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 12:55:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:55,095 INFO L225 Difference]: With dead ends: 5295 [2019-12-07 12:55:55,095 INFO L226 Difference]: Without dead ends: 5295 [2019-12-07 12:55:55,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:55:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2019-12-07 12:55:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 4594. [2019-12-07 12:55:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2019-12-07 12:55:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 9975 transitions. [2019-12-07 12:55:55,136 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 9975 transitions. Word has length 59 [2019-12-07 12:55:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:55,136 INFO L462 AbstractCegarLoop]: Abstraction has 4594 states and 9975 transitions. [2019-12-07 12:55:55,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 9975 transitions. [2019-12-07 12:55:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:55:55,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:55,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:55,141 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:55,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2015434593, now seen corresponding path program 1 times [2019-12-07 12:55:55,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:55,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33460892] [2019-12-07 12:55:55,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:55,211 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 12:55:55,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33460892] [2019-12-07 12:55:55,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:55,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:55,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570736647] [2019-12-07 12:55:55,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:55,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:55:55,212 INFO L87 Difference]: Start difference. First operand 4594 states and 9975 transitions. Second operand 4 states. [2019-12-07 12:55:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:55,244 INFO L93 Difference]: Finished difference Result 5264 states and 11372 transitions. [2019-12-07 12:55:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:55,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 12:55:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:55,249 INFO L225 Difference]: With dead ends: 5264 [2019-12-07 12:55:55,249 INFO L226 Difference]: Without dead ends: 4740 [2019-12-07 12:55:55,250 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 12:55:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2019-12-07 12:55:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 4120. [2019-12-07 12:55:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2019-12-07 12:55:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 8903 transitions. [2019-12-07 12:55:55,306 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 8903 transitions. Word has length 60 [2019-12-07 12:55:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:55,306 INFO L462 AbstractCegarLoop]: Abstraction has 4120 states and 8903 transitions. [2019-12-07 12:55:55,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 8903 transitions. [2019-12-07 12:55:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:55:55,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:55,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:55,311 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash -348317429, now seen corresponding path program 2 times [2019-12-07 12:55:55,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:55,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016888362] [2019-12-07 12:55:55,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:55,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016888362] [2019-12-07 12:55:55,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:55,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:55:55,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262536463] [2019-12-07 12:55:55,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:55,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:55,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:55,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:55:55,382 INFO L87 Difference]: Start difference. First operand 4120 states and 8903 transitions. Second operand 5 states. [2019-12-07 12:55:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:55,415 INFO L93 Difference]: Finished difference Result 4784 states and 10290 transitions. [2019-12-07 12:55:55,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:55:55,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-07 12:55:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:55,416 INFO L225 Difference]: With dead ends: 4784 [2019-12-07 12:55:55,416 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 12:55:55,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 12:55:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2019-12-07 12:55:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-12-07 12:55:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1475 transitions. [2019-12-07 12:55:55,425 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1475 transitions. Word has length 60 [2019-12-07 12:55:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:55,425 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1475 transitions. [2019-12-07 12:55:55,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:55:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1475 transitions. [2019-12-07 12:55:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:55:55,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:55,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:55,427 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 3 times [2019-12-07 12:55:55,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:55,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577925612] [2019-12-07 12:55:55,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:55,675 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 12:55:55,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577925612] [2019-12-07 12:55:55,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 12:55:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24605050] [2019-12-07 12:55:55,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:55:55,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:55:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:55:55,676 INFO L87 Difference]: Start difference. First operand 729 states and 1475 transitions. Second operand 15 states. [2019-12-07 12:55:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:56,272 INFO L93 Difference]: Finished difference Result 1236 states and 2497 transitions. [2019-12-07 12:55:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:55:56,273 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-07 12:55:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:56,274 INFO L225 Difference]: With dead ends: 1236 [2019-12-07 12:55:56,274 INFO L226 Difference]: Without dead ends: 1113 [2019-12-07 12:55:56,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2019-12-07 12:55:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-12-07 12:55:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 765. [2019-12-07 12:55:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-07 12:55:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1544 transitions. [2019-12-07 12:55:56,285 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1544 transitions. Word has length 60 [2019-12-07 12:55:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:56,285 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1544 transitions. [2019-12-07 12:55:56,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:55:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1544 transitions. [2019-12-07 12:55:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:55:56,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:56,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:56,287 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1316868117, now seen corresponding path program 4 times [2019-12-07 12:55:56,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:56,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464048128] [2019-12-07 12:55:56,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:56,344 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 12:55:56,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464048128] [2019-12-07 12:55:56,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:56,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:55:56,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459695556] [2019-12-07 12:55:56,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:55:56,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:55:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:55:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:56,346 INFO L87 Difference]: Start difference. First operand 765 states and 1544 transitions. Second operand 8 states. [2019-12-07 12:55:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:56,479 INFO L93 Difference]: Finished difference Result 1375 states and 2760 transitions. [2019-12-07 12:55:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:55:56,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-07 12:55:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:56,480 INFO L225 Difference]: With dead ends: 1375 [2019-12-07 12:55:56,480 INFO L226 Difference]: Without dead ends: 971 [2019-12-07 12:55:56,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:55:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-12-07 12:55:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 783. [2019-12-07 12:55:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 12:55:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1566 transitions. [2019-12-07 12:55:56,487 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1566 transitions. Word has length 60 [2019-12-07 12:55:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:56,487 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1566 transitions. [2019-12-07 12:55:56,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:55:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1566 transitions. [2019-12-07 12:55:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:55:56,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:56,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:56,488 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 5 times [2019-12-07 12:55:56,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:55:56,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712689178] [2019-12-07 12:55:56,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:55:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:55:56,554 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:55:56,554 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:55:56,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1735~0.base_28| 4)) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28| 1)) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1735~0.base=|v_ULTIMATE.start_main_~#t1735~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1735~0.offset=|v_ULTIMATE.start_main_~#t1735~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1735~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1735~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1736~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:55:56,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1736~0.base_13|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1736~0.base_13| 0)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13|) |v_ULTIMATE.start_main_~#t1736~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1736~0.base_13| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1736~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1736~0.offset] because there is no mapped edge [2019-12-07 12:55:56,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:55:56,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2078711086 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2078711086 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out2078711086| ~y$w_buff0~0_In2078711086) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out2078711086| ~y$w_buff1~0_In2078711086) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2078711086, ~y$w_buff1~0=~y$w_buff1~0_In2078711086, ~y$w_buff0~0=~y$w_buff0~0_In2078711086, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2078711086} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2078711086, ~y$w_buff1~0=~y$w_buff1~0_In2078711086, ~y$w_buff0~0=~y$w_buff0~0_In2078711086, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2078711086, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out2078711086|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:55:56,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:55:56,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 12:55:56,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1671381570 256) 0))) (or (and .cse0 (= ~y~0_In-1671381570 |P1Thread1of1ForFork1_#t~ite48_Out-1671381570|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1671381570 |P1Thread1of1ForFork1_#t~ite48_Out-1671381570|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1671381570, ~y$flush_delayed~0=~y$flush_delayed~0_In-1671381570, ~y~0=~y~0_In-1671381570} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1671381570, ~y$flush_delayed~0=~y$flush_delayed~0_In-1671381570, ~y~0=~y~0_In-1671381570, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1671381570|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 12:55:56,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-33785185 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-33785185 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-33785185| ~y$w_buff0_used~0_In-33785185)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-33785185| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-33785185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-33785185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-33785185, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-33785185|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-33785185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 12:55:56,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1949289410 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1949289410 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1949289410 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1949289410 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1949289410 |P1Thread1of1ForFork1_#t~ite52_Out-1949289410|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-1949289410|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1949289410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1949289410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1949289410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1949289410} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1949289410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1949289410, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1949289410|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1949289410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1949289410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 12:55:56,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In889636872 256))) (.cse2 (= ~y$r_buff0_thd2~0_In889636872 ~y$r_buff0_thd2~0_Out889636872)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In889636872 256) 0))) (or (and (= 0 ~y$r_buff0_thd2~0_Out889636872) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In889636872, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In889636872} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out889636872|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In889636872, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out889636872} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:55:56,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1524939476 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1524939476 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1524939476 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1524939476 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1524939476 |P1Thread1of1ForFork1_#t~ite54_Out-1524939476|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite54_Out-1524939476| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1524939476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524939476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1524939476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1524939476} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1524939476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524939476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1524939476, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1524939476|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1524939476} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:55:56,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:55:56,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1644141527 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1644141527| ~y$mem_tmp~0_In1644141527) (not .cse0)) (and .cse0 (= ~y~0_In1644141527 |P0Thread1of1ForFork0_#t~ite25_Out1644141527|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1644141527, ~y$flush_delayed~0=~y$flush_delayed~0_In1644141527, ~y~0=~y~0_In1644141527} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1644141527, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1644141527|, ~y$flush_delayed~0=~y$flush_delayed~0_In1644141527, ~y~0=~y~0_In1644141527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 12:55:56,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 12:55:56,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:55:56,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In934325318 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In934325318 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out934325318| ~y~0_In934325318)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In934325318 |ULTIMATE.start_main_#t~ite57_Out934325318|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In934325318, ~y~0=~y~0_In934325318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In934325318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934325318} OutVars{~y$w_buff1~0=~y$w_buff1~0_In934325318, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out934325318|, ~y~0=~y~0_In934325318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In934325318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934325318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 12:55:56,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 12:55:56,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-109691059 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-109691059 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-109691059|)) (and (= ~y$w_buff0_used~0_In-109691059 |ULTIMATE.start_main_#t~ite59_Out-109691059|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109691059, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-109691059} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109691059, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-109691059, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-109691059|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:55:56,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1494803630 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1494803630 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1494803630 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1494803630 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1494803630 |ULTIMATE.start_main_#t~ite60_Out1494803630|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out1494803630|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1494803630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1494803630, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1494803630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1494803630} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1494803630|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1494803630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1494803630, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1494803630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1494803630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:55:56,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1145403471 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1145403471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1145403471| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1145403471| ~y$r_buff0_thd0~0_In-1145403471)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145403471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1145403471} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1145403471|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145403471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1145403471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:55:56,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In975358360 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In975358360 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In975358360 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In975358360 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out975358360| ~y$r_buff1_thd0~0_In975358360) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite62_Out975358360| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In975358360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975358360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In975358360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In975358360} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out975358360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In975358360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975358360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In975358360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In975358360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:55:56,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:55:56,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:55:56 BasicIcfg [2019-12-07 12:55:56,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:55:56,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:55:56,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:55:56,618 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:55:56,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:55:41" (3/4) ... [2019-12-07 12:55:56,619 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:55:56,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1735~0.base_28| 4)) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28| 1)) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1735~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1735~0.base_28|) |v_ULTIMATE.start_main_~#t1735~0.offset_20| 0)) |v_#memory_int_13|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1735~0.base=|v_ULTIMATE.start_main_~#t1735~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_17|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1735~0.offset=|v_ULTIMATE.start_main_~#t1735~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1735~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1735~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1736~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:55:56,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1736~0.base_13|) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1736~0.base_13| 0)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1736~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1736~0.base_13|) |v_ULTIMATE.start_main_~#t1736~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1736~0.base_13| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1736~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1736~0.base=|v_ULTIMATE.start_main_~#t1736~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1736~0.offset=|v_ULTIMATE.start_main_~#t1736~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1736~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1736~0.offset] because there is no mapped edge [2019-12-07 12:55:56,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:55:56,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2078711086 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2078711086 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out2078711086| ~y$w_buff0~0_In2078711086) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out2078711086| ~y$w_buff1~0_In2078711086) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2078711086, ~y$w_buff1~0=~y$w_buff1~0_In2078711086, ~y$w_buff0~0=~y$w_buff0~0_In2078711086, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2078711086} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2078711086, ~y$w_buff1~0=~y$w_buff1~0_In2078711086, ~y$w_buff0~0=~y$w_buff0~0_In2078711086, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2078711086, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out2078711086|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:55:56,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:55:56,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 12:55:56,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1671381570 256) 0))) (or (and .cse0 (= ~y~0_In-1671381570 |P1Thread1of1ForFork1_#t~ite48_Out-1671381570|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1671381570 |P1Thread1of1ForFork1_#t~ite48_Out-1671381570|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1671381570, ~y$flush_delayed~0=~y$flush_delayed~0_In-1671381570, ~y~0=~y~0_In-1671381570} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1671381570, ~y$flush_delayed~0=~y$flush_delayed~0_In-1671381570, ~y~0=~y~0_In-1671381570, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1671381570|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 12:55:56,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-33785185 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-33785185 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-33785185| ~y$w_buff0_used~0_In-33785185)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-33785185| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-33785185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-33785185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-33785185, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-33785185|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-33785185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 12:55:56,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1949289410 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1949289410 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1949289410 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1949289410 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1949289410 |P1Thread1of1ForFork1_#t~ite52_Out-1949289410|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-1949289410|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1949289410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1949289410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1949289410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1949289410} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1949289410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1949289410, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1949289410|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1949289410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1949289410} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 12:55:56,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In889636872 256))) (.cse2 (= ~y$r_buff0_thd2~0_In889636872 ~y$r_buff0_thd2~0_Out889636872)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In889636872 256) 0))) (or (and (= 0 ~y$r_buff0_thd2~0_Out889636872) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In889636872, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In889636872} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out889636872|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In889636872, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out889636872} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:55:56,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1524939476 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1524939476 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1524939476 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1524939476 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1524939476 |P1Thread1of1ForFork1_#t~ite54_Out-1524939476|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite54_Out-1524939476| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1524939476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524939476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1524939476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1524939476} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1524939476, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1524939476, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1524939476, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1524939476|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1524939476} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:55:56,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:55:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1644141527 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1644141527| ~y$mem_tmp~0_In1644141527) (not .cse0)) (and .cse0 (= ~y~0_In1644141527 |P0Thread1of1ForFork0_#t~ite25_Out1644141527|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1644141527, ~y$flush_delayed~0=~y$flush_delayed~0_In1644141527, ~y~0=~y~0_In1644141527} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1644141527, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1644141527|, ~y$flush_delayed~0=~y$flush_delayed~0_In1644141527, ~y~0=~y~0_In1644141527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 12:55:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 12:55:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:55:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In934325318 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In934325318 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out934325318| ~y~0_In934325318)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In934325318 |ULTIMATE.start_main_#t~ite57_Out934325318|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In934325318, ~y~0=~y~0_In934325318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In934325318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934325318} OutVars{~y$w_buff1~0=~y$w_buff1~0_In934325318, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out934325318|, ~y~0=~y~0_In934325318, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In934325318, ~y$w_buff1_used~0=~y$w_buff1_used~0_In934325318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 12:55:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 12:55:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-109691059 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-109691059 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-109691059|)) (and (= ~y$w_buff0_used~0_In-109691059 |ULTIMATE.start_main_#t~ite59_Out-109691059|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109691059, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-109691059} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109691059, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-109691059, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-109691059|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:55:56,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1494803630 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1494803630 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1494803630 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1494803630 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1494803630 |ULTIMATE.start_main_#t~ite60_Out1494803630|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out1494803630|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1494803630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1494803630, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1494803630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1494803630} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1494803630|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1494803630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1494803630, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1494803630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1494803630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:55:56,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1145403471 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1145403471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1145403471| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1145403471| ~y$r_buff0_thd0~0_In-1145403471)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145403471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1145403471} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1145403471|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1145403471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1145403471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:55:56,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In975358360 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In975358360 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In975358360 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In975358360 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out975358360| ~y$r_buff1_thd0~0_In975358360) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite62_Out975358360| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In975358360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975358360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In975358360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In975358360} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out975358360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In975358360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In975358360, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In975358360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In975358360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:55:56,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:55:56,683 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc641bcd-af48-426a-832e-0e674e0f675a/bin/utaipan/witness.graphml [2019-12-07 12:55:56,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:55:56,684 INFO L168 Benchmark]: Toolchain (without parser) took 16390.22 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 935.3 MB in the beginning and 845.7 MB in the end (delta: 89.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,685 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:55:56,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -112.5 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,685 INFO L168 Benchmark]: Boogie Preprocessor took 26.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,686 INFO L168 Benchmark]: RCFGBuilder took 432.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 982.2 MB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,686 INFO L168 Benchmark]: TraceAbstraction took 15434.10 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 956.8 MB). Free memory was 980.9 MB in the beginning and 888.3 MB in the end (delta: 92.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,686 INFO L168 Benchmark]: Witness Printer took 65.93 ms. Allocated memory is still 2.1 GB. Free memory was 888.3 MB in the beginning and 845.7 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:55:56,687 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.2 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -112.5 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 432.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 982.2 MB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15434.10 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 956.8 MB). Free memory was 980.9 MB in the beginning and 888.3 MB in the end (delta: 92.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 65.93 ms. Allocated memory is still 2.1 GB. Free memory was 888.3 MB in the beginning and 845.7 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1735, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1736, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3641 SDtfs, 3772 SDslu, 6575 SDs, 0 SdLazy, 3001 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 34 SyntacticMatches, 12 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60518occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 20132 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 156088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...