./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010_pso.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_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/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 0022434ac636950e369a1f65bbc780d7b71e39a3 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:07:30,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:07:30,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:07:30,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:07:30,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:07:30,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:07:30,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:07:30,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:07:30,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:07:30,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:07:30,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:07:30,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:07:30,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:07:30,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:07:30,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:07:30,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:07:30,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:07:30,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:07:30,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:07:30,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:07:30,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:07:30,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:07:30,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:07:30,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:07:30,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:07:30,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:07:30,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:07:30,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:07:30,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:07:30,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:07:30,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:07:30,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:07:30,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:07:30,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:07:30,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:07:30,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:07:30,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:07:30,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:07:30,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:07:30,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:07:30,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:07:30,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 22:07:30,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:07:30,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:07:30,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:07:30,571 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:07:30,571 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 22:07:30,572 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:07:30,573 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 22:07:30,573 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 22:07:30,573 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 22:07:30,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 22:07:30,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 22:07:30,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:07:30,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:07:30,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:07:30,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:07:30,577 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_b38c55e1-2161-483e-987c-c1171d8974d9/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 -> 0022434ac636950e369a1f65bbc780d7b71e39a3 [2019-12-07 22:07:30,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:07:30,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:07:30,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:07:30,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:07:30,696 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:07:30,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix010_pso.opt.i [2019-12-07 22:07:30,733 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/data/6fee05640/6445b70df9ef4b80b7742838ed0974d3/FLAGcb448e05f [2019-12-07 22:07:31,110 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:07:31,111 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/sv-benchmarks/c/pthread-wmm/mix010_pso.opt.i [2019-12-07 22:07:31,121 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/data/6fee05640/6445b70df9ef4b80b7742838ed0974d3/FLAGcb448e05f [2019-12-07 22:07:31,130 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/data/6fee05640/6445b70df9ef4b80b7742838ed0974d3 [2019-12-07 22:07:31,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:07:31,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:07:31,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:31,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:07:31,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:07:31,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31, skipping insertion in model container [2019-12-07 22:07:31,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:07:31,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:07:31,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:31,431 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:07:31,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:31,518 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:07:31,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31 WrapperNode [2019-12-07 22:07:31,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:31,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:31,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:07:31,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:07:31,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:31,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:07:31,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:07:31,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:07:31,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... [2019-12-07 22:07:31,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:07:31,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:07:31,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:07:31,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:07:31,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/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 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 22:07:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 22:07:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 22:07:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 22:07:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 22:07:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 22:07:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:07:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:07:31,629 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 22:07:32,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:07:32,020 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 22:07:32,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:32 BoogieIcfgContainer [2019-12-07 22:07:32,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:07:32,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:07:32,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:07:32,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:07:32,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:31" (1/3) ... [2019-12-07 22:07:32,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c8395d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:32, skipping insertion in model container [2019-12-07 22:07:32,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:31" (2/3) ... [2019-12-07 22:07:32,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c8395d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:32, skipping insertion in model container [2019-12-07 22:07:32,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:32" (3/3) ... [2019-12-07 22:07:32,026 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.opt.i [2019-12-07 22:07:32,032 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 22:07:32,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:07:32,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 22:07:32,037 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 22:07:32,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,066 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 22:07:32,105 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 22:07:32,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:07:32,118 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 22:07:32,118 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:07:32,118 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:07:32,118 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:07:32,118 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:07:32,118 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:07:32,118 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:07:32,129 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 22:07:32,130 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 22:07:32,205 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 22:07:32,205 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 22:07:32,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 22:07:32,239 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 22:07:32,275 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 22:07:32,275 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 22:07:32,283 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 913 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 22:07:32,306 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 22:07:32,307 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 22:07:35,664 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 22:07:36,032 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 22:07:36,134 INFO L206 etLargeBlockEncoding]: Checked pairs total: 138188 [2019-12-07 22:07:36,135 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 22:07:36,137 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 129 transitions [2019-12-07 22:07:38,882 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-07 22:07:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-07 22:07:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 22:07:38,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:38,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:38,888 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1166715454, now seen corresponding path program 1 times [2019-12-07 22:07:38,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:38,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458920594] [2019-12-07 22:07:38,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:39,060 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 22:07:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458920594] [2019-12-07 22:07:39,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:39,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:07:39,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409368515] [2019-12-07 22:07:39,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:39,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:39,075 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-07 22:07:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:39,455 INFO L93 Difference]: Finished difference Result 43270 states and 177632 transitions. [2019-12-07 22:07:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:39,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 22:07:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:39,699 INFO L225 Difference]: With dead ends: 43270 [2019-12-07 22:07:39,699 INFO L226 Difference]: Without dead ends: 40300 [2019-12-07 22:07:39,700 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 22:07:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40300 states. [2019-12-07 22:07:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40300 to 40300. [2019-12-07 22:07:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40300 states. [2019-12-07 22:07:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40300 states to 40300 states and 165323 transitions. [2019-12-07 22:07:41,157 INFO L78 Accepts]: Start accepts. Automaton has 40300 states and 165323 transitions. Word has length 7 [2019-12-07 22:07:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:41,157 INFO L462 AbstractCegarLoop]: Abstraction has 40300 states and 165323 transitions. [2019-12-07 22:07:41,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 40300 states and 165323 transitions. [2019-12-07 22:07:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 22:07:41,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:41,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:41,161 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash 446345132, now seen corresponding path program 1 times [2019-12-07 22:07:41,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:41,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443440482] [2019-12-07 22:07:41,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:41,349 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 22:07:41,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443440482] [2019-12-07 22:07:41,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:41,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:41,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167066995] [2019-12-07 22:07:41,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:41,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:41,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:41,351 INFO L87 Difference]: Start difference. First operand 40300 states and 165323 transitions. Second operand 4 states. [2019-12-07 22:07:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:41,826 INFO L93 Difference]: Finished difference Result 64232 states and 253053 transitions. [2019-12-07 22:07:41,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:07:41,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 22:07:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:41,989 INFO L225 Difference]: With dead ends: 64232 [2019-12-07 22:07:41,989 INFO L226 Difference]: Without dead ends: 64202 [2019-12-07 22:07:41,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:07:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64202 states. [2019-12-07 22:07:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64202 to 62556. [2019-12-07 22:07:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62556 states. [2019-12-07 22:07:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 247863 transitions. [2019-12-07 22:07:43,958 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 247863 transitions. Word has length 13 [2019-12-07 22:07:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:43,958 INFO L462 AbstractCegarLoop]: Abstraction has 62556 states and 247863 transitions. [2019-12-07 22:07:43,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 247863 transitions. [2019-12-07 22:07:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 22:07:43,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:43,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:43,965 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1030418596, now seen corresponding path program 1 times [2019-12-07 22:07:43,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:43,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139767161] [2019-12-07 22:07:43,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:44,022 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 22:07:44,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139767161] [2019-12-07 22:07:44,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:44,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:44,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93740015] [2019-12-07 22:07:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:44,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:44,023 INFO L87 Difference]: Start difference. First operand 62556 states and 247863 transitions. Second operand 4 states. [2019-12-07 22:07:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:44,495 INFO L93 Difference]: Finished difference Result 80364 states and 313729 transitions. [2019-12-07 22:07:44,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:07:44,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 22:07:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:44,702 INFO L225 Difference]: With dead ends: 80364 [2019-12-07 22:07:44,702 INFO L226 Difference]: Without dead ends: 80336 [2019-12-07 22:07:44,702 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 22:07:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80336 states. [2019-12-07 22:07:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80336 to 71524. [2019-12-07 22:07:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71524 states. [2019-12-07 22:07:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71524 states to 71524 states and 281953 transitions. [2019-12-07 22:07:48,458 INFO L78 Accepts]: Start accepts. Automaton has 71524 states and 281953 transitions. Word has length 16 [2019-12-07 22:07:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:48,458 INFO L462 AbstractCegarLoop]: Abstraction has 71524 states and 281953 transitions. [2019-12-07 22:07:48,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 71524 states and 281953 transitions. [2019-12-07 22:07:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:07:48,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:48,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:48,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:48,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:48,465 INFO L82 PathProgramCache]: Analyzing trace with hash -239561606, now seen corresponding path program 1 times [2019-12-07 22:07:48,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:48,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649474207] [2019-12-07 22:07:48,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:48,515 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 22:07:48,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649474207] [2019-12-07 22:07:48,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:48,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:48,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797425156] [2019-12-07 22:07:48,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:48,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:48,517 INFO L87 Difference]: Start difference. First operand 71524 states and 281953 transitions. Second operand 3 states. [2019-12-07 22:07:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:48,794 INFO L93 Difference]: Finished difference Result 71524 states and 278893 transitions. [2019-12-07 22:07:48,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:48,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 22:07:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:48,958 INFO L225 Difference]: With dead ends: 71524 [2019-12-07 22:07:48,959 INFO L226 Difference]: Without dead ends: 71524 [2019-12-07 22:07:48,959 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 22:07:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71524 states. [2019-12-07 22:07:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71524 to 71316. [2019-12-07 22:07:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71316 states. [2019-12-07 22:07:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71316 states to 71316 states and 278233 transitions. [2019-12-07 22:07:50,844 INFO L78 Accepts]: Start accepts. Automaton has 71316 states and 278233 transitions. Word has length 18 [2019-12-07 22:07:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:50,844 INFO L462 AbstractCegarLoop]: Abstraction has 71316 states and 278233 transitions. [2019-12-07 22:07:50,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 71316 states and 278233 transitions. [2019-12-07 22:07:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:07:50,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:50,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:50,849 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 419417230, now seen corresponding path program 1 times [2019-12-07 22:07:50,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:50,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886873267] [2019-12-07 22:07:50,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:50,903 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 22:07:50,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886873267] [2019-12-07 22:07:50,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:50,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:07:50,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997269254] [2019-12-07 22:07:50,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:50,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:50,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:50,904 INFO L87 Difference]: Start difference. First operand 71316 states and 278233 transitions. Second operand 3 states. [2019-12-07 22:07:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:51,186 INFO L93 Difference]: Finished difference Result 71336 states and 278133 transitions. [2019-12-07 22:07:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:51,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 22:07:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:51,337 INFO L225 Difference]: With dead ends: 71336 [2019-12-07 22:07:51,337 INFO L226 Difference]: Without dead ends: 71336 [2019-12-07 22:07:51,337 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 22:07:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71336 states. [2019-12-07 22:07:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71336 to 71251. [2019-12-07 22:07:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71251 states. [2019-12-07 22:07:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71251 states to 71251 states and 277954 transitions. [2019-12-07 22:07:53,241 INFO L78 Accepts]: Start accepts. Automaton has 71251 states and 277954 transitions. Word has length 18 [2019-12-07 22:07:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:53,241 INFO L462 AbstractCegarLoop]: Abstraction has 71251 states and 277954 transitions. [2019-12-07 22:07:53,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 71251 states and 277954 transitions. [2019-12-07 22:07:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 22:07:53,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:53,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:53,248 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash -87585687, now seen corresponding path program 1 times [2019-12-07 22:07:53,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:53,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513819391] [2019-12-07 22:07:53,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:53,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513819391] [2019-12-07 22:07:53,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:53,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:53,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189692161] [2019-12-07 22:07:53,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:53,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:53,310 INFO L87 Difference]: Start difference. First operand 71251 states and 277954 transitions. Second operand 4 states. [2019-12-07 22:07:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:53,570 INFO L93 Difference]: Finished difference Result 66904 states and 260443 transitions. [2019-12-07 22:07:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:53,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 22:07:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:53,708 INFO L225 Difference]: With dead ends: 66904 [2019-12-07 22:07:53,708 INFO L226 Difference]: Without dead ends: 66904 [2019-12-07 22:07:53,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66904 states. [2019-12-07 22:07:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66904 to 66904. [2019-12-07 22:07:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66904 states. [2019-12-07 22:07:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66904 states to 66904 states and 260443 transitions. [2019-12-07 22:07:55,548 INFO L78 Accepts]: Start accepts. Automaton has 66904 states and 260443 transitions. Word has length 19 [2019-12-07 22:07:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:55,548 INFO L462 AbstractCegarLoop]: Abstraction has 66904 states and 260443 transitions. [2019-12-07 22:07:55,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 66904 states and 260443 transitions. [2019-12-07 22:07:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 22:07:55,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:55,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:55,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 81142022, now seen corresponding path program 1 times [2019-12-07 22:07:55,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:55,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325100091] [2019-12-07 22:07:55,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:55,611 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 22:07:55,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325100091] [2019-12-07 22:07:55,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:55,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:07:55,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590611155] [2019-12-07 22:07:55,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:07:55,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:55,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:07:55,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:07:55,613 INFO L87 Difference]: Start difference. First operand 66904 states and 260443 transitions. Second operand 5 states. [2019-12-07 22:07:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:56,330 INFO L93 Difference]: Finished difference Result 80160 states and 308169 transitions. [2019-12-07 22:07:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:07:56,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 22:07:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:56,493 INFO L225 Difference]: With dead ends: 80160 [2019-12-07 22:07:56,494 INFO L226 Difference]: Without dead ends: 80108 [2019-12-07 22:07:56,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:07:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80108 states. [2019-12-07 22:07:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80108 to 66540. [2019-12-07 22:07:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66540 states. [2019-12-07 22:07:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66540 states to 66540 states and 259135 transitions. [2019-12-07 22:07:58,436 INFO L78 Accepts]: Start accepts. Automaton has 66540 states and 259135 transitions. Word has length 22 [2019-12-07 22:07:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:58,436 INFO L462 AbstractCegarLoop]: Abstraction has 66540 states and 259135 transitions. [2019-12-07 22:07:58,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:07:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 66540 states and 259135 transitions. [2019-12-07 22:07:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 22:07:58,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:58,496 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 22:07:58,496 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -70807778, now seen corresponding path program 1 times [2019-12-07 22:07:58,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:58,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447299078] [2019-12-07 22:07:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:58,554 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 22:07:58,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447299078] [2019-12-07 22:07:58,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:58,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:58,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480355158] [2019-12-07 22:07:58,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:58,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:58,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:58,556 INFO L87 Difference]: Start difference. First operand 66540 states and 259135 transitions. Second operand 4 states. [2019-12-07 22:07:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:58,816 INFO L93 Difference]: Finished difference Result 66488 states and 258955 transitions. [2019-12-07 22:07:58,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:58,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 22:07:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:58,955 INFO L225 Difference]: With dead ends: 66488 [2019-12-07 22:07:58,955 INFO L226 Difference]: Without dead ends: 66488 [2019-12-07 22:07:58,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66488 states. [2019-12-07 22:08:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66488 to 66488. [2019-12-07 22:08:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66488 states. [2019-12-07 22:08:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66488 states to 66488 states and 258955 transitions. [2019-12-07 22:08:00,726 INFO L78 Accepts]: Start accepts. Automaton has 66488 states and 258955 transitions. Word has length 33 [2019-12-07 22:08:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:00,727 INFO L462 AbstractCegarLoop]: Abstraction has 66488 states and 258955 transitions. [2019-12-07 22:08:00,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 66488 states and 258955 transitions. [2019-12-07 22:08:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 22:08:00,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:00,784 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1087019625, now seen corresponding path program 1 times [2019-12-07 22:08:00,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567161152] [2019-12-07 22:08:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,847 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 22:08:00,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567161152] [2019-12-07 22:08:00,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:00,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:00,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618072767] [2019-12-07 22:08:00,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:00,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:00,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:00,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:00,848 INFO L87 Difference]: Start difference. First operand 66488 states and 258955 transitions. Second operand 5 states. [2019-12-07 22:08:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:01,313 INFO L93 Difference]: Finished difference Result 92690 states and 366351 transitions. [2019-12-07 22:08:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:08:01,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 22:08:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:01,507 INFO L225 Difference]: With dead ends: 92690 [2019-12-07 22:08:01,507 INFO L226 Difference]: Without dead ends: 92690 [2019-12-07 22:08:01,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:08:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92690 states. [2019-12-07 22:08:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92690 to 90168. [2019-12-07 22:08:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90168 states. [2019-12-07 22:08:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90168 states to 90168 states and 357275 transitions. [2019-12-07 22:08:03,860 INFO L78 Accepts]: Start accepts. Automaton has 90168 states and 357275 transitions. Word has length 34 [2019-12-07 22:08:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,860 INFO L462 AbstractCegarLoop]: Abstraction has 90168 states and 357275 transitions. [2019-12-07 22:08:03,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90168 states and 357275 transitions. [2019-12-07 22:08:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 22:08:03,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,951 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:03,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2074469443, now seen corresponding path program 2 times [2019-12-07 22:08:03,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190514686] [2019-12-07 22:08:03,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:04,090 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 22:08:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190514686] [2019-12-07 22:08:04,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:04,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 22:08:04,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871287803] [2019-12-07 22:08:04,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:08:04,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:04,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:08:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:08:04,092 INFO L87 Difference]: Start difference. First operand 90168 states and 357275 transitions. Second operand 9 states. [2019-12-07 22:08:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:05,092 INFO L93 Difference]: Finished difference Result 125602 states and 498416 transitions. [2019-12-07 22:08:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 22:08:05,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 22:08:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:05,379 INFO L225 Difference]: With dead ends: 125602 [2019-12-07 22:08:05,379 INFO L226 Difference]: Without dead ends: 125602 [2019-12-07 22:08:05,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-12-07 22:08:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125602 states. [2019-12-07 22:08:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125602 to 93806. [2019-12-07 22:08:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93806 states. [2019-12-07 22:08:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93806 states to 93806 states and 372788 transitions. [2019-12-07 22:08:08,183 INFO L78 Accepts]: Start accepts. Automaton has 93806 states and 372788 transitions. Word has length 34 [2019-12-07 22:08:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:08,183 INFO L462 AbstractCegarLoop]: Abstraction has 93806 states and 372788 transitions. [2019-12-07 22:08:08,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:08:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 93806 states and 372788 transitions. [2019-12-07 22:08:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 22:08:08,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:08,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:08,275 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1895308249, now seen corresponding path program 3 times [2019-12-07 22:08:08,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:08,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573761112] [2019-12-07 22:08:08,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:08,338 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 22:08:08,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573761112] [2019-12-07 22:08:08,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:08,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:08,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395895160] [2019-12-07 22:08:08,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:08,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:08,340 INFO L87 Difference]: Start difference. First operand 93806 states and 372788 transitions. Second operand 6 states. [2019-12-07 22:08:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:08,880 INFO L93 Difference]: Finished difference Result 121710 states and 482810 transitions. [2019-12-07 22:08:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:08,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 22:08:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:09,140 INFO L225 Difference]: With dead ends: 121710 [2019-12-07 22:08:09,140 INFO L226 Difference]: Without dead ends: 107102 [2019-12-07 22:08:09,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:08:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107102 states. [2019-12-07 22:08:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107102 to 107102. [2019-12-07 22:08:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107102 states. [2019-12-07 22:08:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107102 states to 107102 states and 427078 transitions. [2019-12-07 22:08:11,914 INFO L78 Accepts]: Start accepts. Automaton has 107102 states and 427078 transitions. Word has length 34 [2019-12-07 22:08:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:11,914 INFO L462 AbstractCegarLoop]: Abstraction has 107102 states and 427078 transitions. [2019-12-07 22:08:11,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 107102 states and 427078 transitions. [2019-12-07 22:08:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 22:08:12,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:12,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:12,017 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -977505411, now seen corresponding path program 4 times [2019-12-07 22:08:12,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:12,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264293137] [2019-12-07 22:08:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:12,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264293137] [2019-12-07 22:08:12,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:12,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 22:08:12,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495470705] [2019-12-07 22:08:12,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 22:08:12,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 22:08:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:08:12,164 INFO L87 Difference]: Start difference. First operand 107102 states and 427078 transitions. Second operand 10 states. [2019-12-07 22:08:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:13,232 INFO L93 Difference]: Finished difference Result 187766 states and 745328 transitions. [2019-12-07 22:08:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 22:08:13,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 22:08:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:13,639 INFO L225 Difference]: With dead ends: 187766 [2019-12-07 22:08:13,640 INFO L226 Difference]: Without dead ends: 177868 [2019-12-07 22:08:13,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-12-07 22:08:14,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177868 states. [2019-12-07 22:08:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177868 to 91604. [2019-12-07 22:08:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91604 states. [2019-12-07 22:08:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91604 states to 91604 states and 363383 transitions. [2019-12-07 22:08:16,936 INFO L78 Accepts]: Start accepts. Automaton has 91604 states and 363383 transitions. Word has length 34 [2019-12-07 22:08:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:16,936 INFO L462 AbstractCegarLoop]: Abstraction has 91604 states and 363383 transitions. [2019-12-07 22:08:16,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 22:08:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 91604 states and 363383 transitions. [2019-12-07 22:08:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 22:08:17,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:17,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:17,028 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:17,028 INFO L82 PathProgramCache]: Analyzing trace with hash -159612891, now seen corresponding path program 5 times [2019-12-07 22:08:17,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:17,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779195287] [2019-12-07 22:08:17,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:17,098 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 22:08:17,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779195287] [2019-12-07 22:08:17,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:17,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 22:08:17,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749280340] [2019-12-07 22:08:17,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:08:17,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:08:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:17,100 INFO L87 Difference]: Start difference. First operand 91604 states and 363383 transitions. Second operand 8 states. [2019-12-07 22:08:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:18,262 INFO L93 Difference]: Finished difference Result 164168 states and 648415 transitions. [2019-12-07 22:08:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 22:08:18,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 22:08:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:18,632 INFO L225 Difference]: With dead ends: 164168 [2019-12-07 22:08:18,632 INFO L226 Difference]: Without dead ends: 164168 [2019-12-07 22:08:18,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-07 22:08:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164168 states. [2019-12-07 22:08:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164168 to 129078. [2019-12-07 22:08:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129078 states. [2019-12-07 22:08:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129078 states to 129078 states and 511512 transitions. [2019-12-07 22:08:22,198 INFO L78 Accepts]: Start accepts. Automaton has 129078 states and 511512 transitions. Word has length 34 [2019-12-07 22:08:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:22,198 INFO L462 AbstractCegarLoop]: Abstraction has 129078 states and 511512 transitions. [2019-12-07 22:08:22,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:08:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 129078 states and 511512 transitions. [2019-12-07 22:08:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 22:08:22,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:22,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:22,326 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash 597707711, now seen corresponding path program 6 times [2019-12-07 22:08:22,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:22,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840123103] [2019-12-07 22:08:22,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:22,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840123103] [2019-12-07 22:08:22,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:22,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:22,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859355535] [2019-12-07 22:08:22,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:22,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:22,364 INFO L87 Difference]: Start difference. First operand 129078 states and 511512 transitions. Second operand 4 states. [2019-12-07 22:08:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:22,643 INFO L93 Difference]: Finished difference Result 75039 states and 260578 transitions. [2019-12-07 22:08:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:22,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 22:08:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:22,768 INFO L225 Difference]: With dead ends: 75039 [2019-12-07 22:08:22,768 INFO L226 Difference]: Without dead ends: 69051 [2019-12-07 22:08:22,768 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 22:08:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69051 states. [2019-12-07 22:08:24,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69051 to 69051. [2019-12-07 22:08:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69051 states. [2019-12-07 22:08:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69051 states to 69051 states and 239210 transitions. [2019-12-07 22:08:24,316 INFO L78 Accepts]: Start accepts. Automaton has 69051 states and 239210 transitions. Word has length 34 [2019-12-07 22:08:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:24,317 INFO L462 AbstractCegarLoop]: Abstraction has 69051 states and 239210 transitions. [2019-12-07 22:08:24,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 69051 states and 239210 transitions. [2019-12-07 22:08:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 22:08:24,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:24,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:24,371 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash -310453550, now seen corresponding path program 1 times [2019-12-07 22:08:24,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:24,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804441421] [2019-12-07 22:08:24,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:24,413 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 22:08:24,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804441421] [2019-12-07 22:08:24,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:24,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:24,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227873671] [2019-12-07 22:08:24,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:24,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:24,415 INFO L87 Difference]: Start difference. First operand 69051 states and 239210 transitions. Second operand 5 states. [2019-12-07 22:08:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:24,471 INFO L93 Difference]: Finished difference Result 10691 states and 33179 transitions. [2019-12-07 22:08:24,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:24,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 22:08:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:24,481 INFO L225 Difference]: With dead ends: 10691 [2019-12-07 22:08:24,481 INFO L226 Difference]: Without dead ends: 7573 [2019-12-07 22:08:24,481 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 22:08:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-07 22:08:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-07 22:08:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-07 22:08:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 22153 transitions. [2019-12-07 22:08:24,568 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 22153 transitions. Word has length 35 [2019-12-07 22:08:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:24,568 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 22153 transitions. [2019-12-07 22:08:24,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 22153 transitions. [2019-12-07 22:08:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 22:08:24,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:24,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:24,574 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1481374704, now seen corresponding path program 1 times [2019-12-07 22:08:24,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:24,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753809560] [2019-12-07 22:08:24,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:24,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753809560] [2019-12-07 22:08:24,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:24,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:24,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211140679] [2019-12-07 22:08:24,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:24,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:24,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:24,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:24,630 INFO L87 Difference]: Start difference. First operand 7573 states and 22153 transitions. Second operand 4 states. [2019-12-07 22:08:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:24,682 INFO L93 Difference]: Finished difference Result 11937 states and 33031 transitions. [2019-12-07 22:08:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:24,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 22:08:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:24,693 INFO L225 Difference]: With dead ends: 11937 [2019-12-07 22:08:24,693 INFO L226 Difference]: Without dead ends: 11747 [2019-12-07 22:08:24,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11747 states. [2019-12-07 22:08:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11747 to 8497. [2019-12-07 22:08:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8497 states. [2019-12-07 22:08:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 24274 transitions. [2019-12-07 22:08:24,803 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 24274 transitions. Word has length 47 [2019-12-07 22:08:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:24,803 INFO L462 AbstractCegarLoop]: Abstraction has 8497 states and 24274 transitions. [2019-12-07 22:08:24,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 24274 transitions. [2019-12-07 22:08:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 22:08:24,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:24,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:24,810 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1934860514, now seen corresponding path program 2 times [2019-12-07 22:08:24,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:24,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932885259] [2019-12-07 22:08:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:24,839 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 22:08:24,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932885259] [2019-12-07 22:08:24,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:24,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:24,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151005412] [2019-12-07 22:08:24,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:24,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:24,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:24,841 INFO L87 Difference]: Start difference. First operand 8497 states and 24274 transitions. Second operand 4 states. [2019-12-07 22:08:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:24,870 INFO L93 Difference]: Finished difference Result 9349 states and 26215 transitions. [2019-12-07 22:08:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:24,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 22:08:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:24,879 INFO L225 Difference]: With dead ends: 9349 [2019-12-07 22:08:24,879 INFO L226 Difference]: Without dead ends: 8212 [2019-12-07 22:08:24,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8212 states. [2019-12-07 22:08:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8212 to 8196. [2019-12-07 22:08:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-07 22:08:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 23531 transitions. [2019-12-07 22:08:24,974 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 23531 transitions. Word has length 47 [2019-12-07 22:08:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:24,975 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 23531 transitions. [2019-12-07 22:08:24,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 23531 transitions. [2019-12-07 22:08:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 22:08:24,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:24,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:24,982 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:24,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:24,982 INFO L82 PathProgramCache]: Analyzing trace with hash -244656218, now seen corresponding path program 3 times [2019-12-07 22:08:24,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:24,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194492211] [2019-12-07 22:08:24,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:25,031 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 22:08:25,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194492211] [2019-12-07 22:08:25,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:25,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 22:08:25,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881605038] [2019-12-07 22:08:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:25,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:25,033 INFO L87 Difference]: Start difference. First operand 8196 states and 23531 transitions. Second operand 6 states. [2019-12-07 22:08:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:25,093 INFO L93 Difference]: Finished difference Result 6583 states and 19822 transitions. [2019-12-07 22:08:25,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:25,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 22:08:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:25,096 INFO L225 Difference]: With dead ends: 6583 [2019-12-07 22:08:25,096 INFO L226 Difference]: Without dead ends: 2824 [2019-12-07 22:08:25,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:08:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2019-12-07 22:08:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2502. [2019-12-07 22:08:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2502 states. [2019-12-07 22:08:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 6661 transitions. [2019-12-07 22:08:25,122 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 6661 transitions. Word has length 47 [2019-12-07 22:08:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:25,122 INFO L462 AbstractCegarLoop]: Abstraction has 2502 states and 6661 transitions. [2019-12-07 22:08:25,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 6661 transitions. [2019-12-07 22:08:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 22:08:25,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:25,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, 1, 1, 1, 1, 1, 1, 1, 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 22:08:25,124 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2056690107, now seen corresponding path program 1 times [2019-12-07 22:08:25,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:25,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186827860] [2019-12-07 22:08:25,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:25,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186827860] [2019-12-07 22:08:25,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:25,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:25,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473912949] [2019-12-07 22:08:25,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:25,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:25,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:25,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:25,169 INFO L87 Difference]: Start difference. First operand 2502 states and 6661 transitions. Second operand 6 states. [2019-12-07 22:08:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:25,263 INFO L93 Difference]: Finished difference Result 5272 states and 14176 transitions. [2019-12-07 22:08:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 22:08:25,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 22:08:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:25,266 INFO L225 Difference]: With dead ends: 5272 [2019-12-07 22:08:25,266 INFO L226 Difference]: Without dead ends: 3276 [2019-12-07 22:08:25,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 22:08:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-12-07 22:08:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 2554. [2019-12-07 22:08:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2019-12-07 22:08:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 6731 transitions. [2019-12-07 22:08:25,294 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 6731 transitions. Word has length 62 [2019-12-07 22:08:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:25,294 INFO L462 AbstractCegarLoop]: Abstraction has 2554 states and 6731 transitions. [2019-12-07 22:08:25,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 6731 transitions. [2019-12-07 22:08:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 22:08:25,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:25,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:25,296 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash 327418911, now seen corresponding path program 1 times [2019-12-07 22:08:25,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:25,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655181925] [2019-12-07 22:08:25,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:25,354 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 22:08:25,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655181925] [2019-12-07 22:08:25,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:25,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:25,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921296197] [2019-12-07 22:08:25,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:25,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:25,355 INFO L87 Difference]: Start difference. First operand 2554 states and 6731 transitions. Second operand 5 states. [2019-12-07 22:08:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:25,377 INFO L93 Difference]: Finished difference Result 2917 states and 7567 transitions. [2019-12-07 22:08:25,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:25,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 22:08:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:25,378 INFO L225 Difference]: With dead ends: 2917 [2019-12-07 22:08:25,378 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 22:08:25,378 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 22:08:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 22:08:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-12-07 22:08:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 22:08:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 933 transitions. [2019-12-07 22:08:25,382 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 933 transitions. Word has length 63 [2019-12-07 22:08:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:25,382 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 933 transitions. [2019-12-07 22:08:25,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 933 transitions. [2019-12-07 22:08:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 22:08:25,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:25,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:25,382 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash 742159584, now seen corresponding path program 1 times [2019-12-07 22:08:25,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:25,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530740495] [2019-12-07 22:08:25,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:25,452 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 22:08:25,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530740495] [2019-12-07 22:08:25,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:25,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 22:08:25,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122031860] [2019-12-07 22:08:25,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:08:25,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:08:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:25,453 INFO L87 Difference]: Start difference. First operand 426 states and 933 transitions. Second operand 8 states. [2019-12-07 22:08:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:25,605 INFO L93 Difference]: Finished difference Result 912 states and 1964 transitions. [2019-12-07 22:08:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 22:08:25,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 22:08:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:25,606 INFO L225 Difference]: With dead ends: 912 [2019-12-07 22:08:25,606 INFO L226 Difference]: Without dead ends: 661 [2019-12-07 22:08:25,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 22:08:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-12-07 22:08:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 515. [2019-12-07 22:08:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-07 22:08:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1093 transitions. [2019-12-07 22:08:25,611 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1093 transitions. Word has length 63 [2019-12-07 22:08:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:25,611 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 1093 transitions. [2019-12-07 22:08:25,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:08:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1093 transitions. [2019-12-07 22:08:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 22:08:25,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:25,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:25,612 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:08:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash -250797522, now seen corresponding path program 2 times [2019-12-07 22:08:25,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:25,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733962300] [2019-12-07 22:08:25,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:08:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:08:25,681 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 22:08:25,681 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 22:08:25,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t266~0.base_119|) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119|)) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t266~0.base_119| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= |v_ULTIMATE.start_main_~#t266~0.offset_66| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119| 1) |v_#valid_150|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119|) |v_ULTIMATE.start_main_~#t266~0.offset_66| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_39|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_~#t266~0.offset=|v_ULTIMATE.start_main_~#t266~0.offset_66|, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_~#t266~0.base=|v_ULTIMATE.start_main_~#t266~0.base_119|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_39|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t268~0.offset, ULTIMATE.start_main_~#t267~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t266~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t266~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_~#t268~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 22:08:25,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t267~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t267~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11|) |v_ULTIMATE.start_main_~#t267~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t267~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t267~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t267~0.base] because there is no mapped edge [2019-12-07 22:08:25,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) |v_ULTIMATE.start_main_~#t268~0.offset_8| 2)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t268~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) (= |v_ULTIMATE.start_main_~#t268~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t268~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t268~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t268~0.offset] because there is no mapped edge [2019-12-07 22:08:25,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 22:08:25,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1280163650 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1280163650 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1280163650| ~z$w_buff1~0_In-1280163650) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-1280163650| ~z$w_buff0~0_In-1280163650)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1280163650, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1280163650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1280163650, ~z$w_buff1~0=~z$w_buff1~0_In-1280163650} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1280163650|, ~z$w_buff0~0=~z$w_buff0~0_In-1280163650, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1280163650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1280163650, ~z$w_buff1~0=~z$w_buff1~0_In-1280163650} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 22:08:25,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 22:08:25,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 22:08:25,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-989143162 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-989143162| ~z$mem_tmp~0_In-989143162)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-989143162| ~z~0_In-989143162)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-989143162, ~z$flush_delayed~0=~z$flush_delayed~0_In-989143162, ~z~0=~z~0_In-989143162} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-989143162|, ~z$mem_tmp~0=~z$mem_tmp~0_In-989143162, ~z$flush_delayed~0=~z$flush_delayed~0_In-989143162, ~z~0=~z~0_In-989143162} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 22:08:25,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 22:08:25,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1060002581 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1060002581 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1060002581|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1060002581 |P2Thread1of1ForFork0_#t~ite51_Out1060002581|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1060002581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1060002581} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1060002581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1060002581, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1060002581|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 22:08:25,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In243796212 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In243796212 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In243796212 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In243796212 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out243796212|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In243796212 |P2Thread1of1ForFork0_#t~ite52_Out243796212|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In243796212, ~z$w_buff1_used~0=~z$w_buff1_used~0_In243796212, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In243796212} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In243796212, ~z$w_buff1_used~0=~z$w_buff1_used~0_In243796212, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out243796212|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In243796212} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 22:08:25,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-381246864 256))) (.cse0 (= ~z$r_buff0_thd3~0_In-381246864 ~z$r_buff0_thd3~0_Out-381246864)) (.cse2 (= (mod ~z$w_buff0_used~0_In-381246864 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-381246864) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-381246864, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-381246864} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-381246864, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-381246864, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-381246864|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 22:08:25,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1901205392 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1901205392 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1901205392 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1901205392 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1901205392|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1901205392 |P2Thread1of1ForFork0_#t~ite54_Out-1901205392|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1901205392, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1901205392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1901205392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1901205392} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1901205392, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1901205392|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1901205392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1901205392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1901205392} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 22:08:25,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 22:08:25,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In163250312 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In163250312 |P1Thread1of1ForFork2_#t~ite25_Out163250312|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out163250312| ~z~0_In163250312) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In163250312, ~z$flush_delayed~0=~z$flush_delayed~0_In163250312, ~z~0=~z~0_In163250312} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In163250312, ~z$flush_delayed~0=~z$flush_delayed~0_In163250312, ~z~0=~z~0_In163250312, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out163250312|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 22:08:25,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 22:08:25,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 22:08:25,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out511566985| |ULTIMATE.start_main_#t~ite58_Out511566985|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In511566985 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In511566985 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out511566985| ~z$w_buff1~0_In511566985) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out511566985| ~z~0_In511566985) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511566985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511566985, ~z$w_buff1~0=~z$w_buff1~0_In511566985, ~z~0=~z~0_In511566985} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511566985, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out511566985|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511566985, ~z$w_buff1~0=~z$w_buff1~0_In511566985, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out511566985|, ~z~0=~z~0_In511566985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 22:08:25,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-951932166 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-951932166 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-951932166|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-951932166 |ULTIMATE.start_main_#t~ite60_Out-951932166|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-951932166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-951932166} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-951932166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-951932166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-951932166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 22:08:25,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In222847711 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In222847711 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In222847711 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In222847711 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out222847711|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In222847711 |ULTIMATE.start_main_#t~ite61_Out222847711|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In222847711, ~z$w_buff0_used~0=~z$w_buff0_used~0_In222847711, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In222847711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In222847711} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In222847711, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out222847711|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In222847711, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In222847711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In222847711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 22:08:25,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1232752788 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1232752788 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1232752788|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1232752788 |ULTIMATE.start_main_#t~ite62_Out-1232752788|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1232752788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1232752788} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1232752788|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1232752788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1232752788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 22:08:25,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1411509713 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1411509713 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1411509713 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1411509713 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1411509713|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite63_Out-1411509713| ~z$r_buff1_thd0~0_In-1411509713)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1411509713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1411509713|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1411509713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 22:08:25,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 22:08:25,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:25 BasicIcfg [2019-12-07 22:08:25,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 22:08:25,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 22:08:25,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 22:08:25,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 22:08:25,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:32" (3/4) ... [2019-12-07 22:08:25,764 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 22:08:25,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_152| 0 0))) (and (= v_~z$r_buff0_thd2~0_460 0) (= v_~z$r_buff1_thd0~0_358 0) (= v_~z$w_buff1_used~0_557 0) (= v_~z~0_402 0) (= v_~main$tmp_guard0~0_30 0) (= v_~weak$$choice2~0_347 0) (= v_~x~0_58 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t266~0.base_119|) (= 0 v_~z$mem_tmp~0_287) (= v_~z$r_buff1_thd1~0_237 0) (= 0 v_~__unbuffered_p0_EAX~0_101) (= v_~z$w_buff1~0_277 0) (= v_~y~0_42 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$r_buff0_thd3~0_660) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_271) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119|)) (= v_~__unbuffered_cnt~0_161 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t266~0.base_119| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= v_~z$r_buff0_thd0~0_225 0) (= v_~__unbuffered_p2_EBX~0_97 0) (= |v_ULTIMATE.start_main_~#t266~0.offset_66| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t266~0.base_119| 1) |v_#valid_150|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_119|) |v_ULTIMATE.start_main_~#t266~0.offset_66| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_118 0) (= v_~a~0_35 0) (= v_~z$r_buff0_thd1~0_170 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_453 0) (= v_~z$w_buff0~0_385 0) (= v_~main$tmp_guard1~0_88 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~z$flush_delayed~0_351) (= v_~z$w_buff0_used~0_979 0) (= 0 v_~z$r_buff1_thd3~0_421))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_152|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_453, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_39|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_91|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_225, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_118, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_~#t266~0.offset=|v_ULTIMATE.start_main_~#t266~0.offset_66|, ~z$mem_tmp~0=v_~z$mem_tmp~0_287, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_97, ULTIMATE.start_main_~#t266~0.base=|v_ULTIMATE.start_main_~#t266~0.base_119|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_557, ~z$flush_delayed~0=v_~z$flush_delayed~0_351, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_178|, ~weak$$choice0~0=v_~weak$$choice0~0_271, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_237, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_660, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~x~0=v_~x~0_58, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_277, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_39|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_66|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_358, ~y~0=v_~y~0_42, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_460, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_979, ~z$w_buff0~0=v_~z$w_buff0~0_385, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_421, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_83|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_378|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_70|, #valid=|v_#valid_150|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_402, ~weak$$choice2~0=v_~weak$$choice2~0_347, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t268~0.offset, ULTIMATE.start_main_~#t267~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t266~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t266~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_~#t268~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 22:08:25,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t267~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t267~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11|) |v_ULTIMATE.start_main_~#t267~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t267~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t267~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t267~0.base] because there is no mapped edge [2019-12-07 22:08:25,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) |v_ULTIMATE.start_main_~#t268~0.offset_8| 2)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t268~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) (= |v_ULTIMATE.start_main_~#t268~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t268~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t268~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t268~0.offset] because there is no mapped edge [2019-12-07 22:08:25,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67)) (= v_~z$w_buff0~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_193 256))) (not (= (mod v_~z$w_buff0_used~0_342 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_343 v_~z$w_buff1_used~0_193) (= |v_P2Thread1of1ForFork0_#in~arg.base_67| v_P2Thread1of1ForFork0_~arg.base_65) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_67| v_P2Thread1of1ForFork0_~arg.offset_65) (= v_~z$w_buff0~0_155 v_~z$w_buff1~0_94) (= v_~z$w_buff0_used~0_342 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_343, ~z$w_buff0~0=v_~z$w_buff0~0_155, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_65, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_67|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_65|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_342, ~z$w_buff0~0=v_~z$w_buff0~0_154, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_65, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_193, ~z$w_buff1~0=v_~z$w_buff1~0_94, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_67|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 22:08:25,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1280163650 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1280163650 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1280163650| ~z$w_buff1~0_In-1280163650) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-1280163650| ~z$w_buff0~0_In-1280163650)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1280163650, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1280163650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1280163650, ~z$w_buff1~0=~z$w_buff1~0_In-1280163650} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1280163650|, ~z$w_buff0~0=~z$w_buff0~0_In-1280163650, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1280163650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1280163650, ~z$w_buff1~0=~z$w_buff1~0_In-1280163650} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 22:08:25,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_29 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, ~z~0=v_~z~0_29, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 22:08:25,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff0_thd3~0_61) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 22:08:25,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-989143162 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-989143162| ~z$mem_tmp~0_In-989143162)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-989143162| ~z~0_In-989143162)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-989143162, ~z$flush_delayed~0=~z$flush_delayed~0_In-989143162, ~z~0=~z~0_In-989143162} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-989143162|, ~z$mem_tmp~0=~z$mem_tmp~0_In-989143162, ~z$flush_delayed~0=~z$flush_delayed~0_In-989143162, ~z~0=~z~0_In-989143162} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 22:08:25,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_16) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35} OutVars{~a~0=v_~a~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 22:08:25,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1060002581 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1060002581 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1060002581|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1060002581 |P2Thread1of1ForFork0_#t~ite51_Out1060002581|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1060002581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1060002581} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1060002581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1060002581, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1060002581|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 22:08:25,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In243796212 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In243796212 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In243796212 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In243796212 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out243796212|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In243796212 |P2Thread1of1ForFork0_#t~ite52_Out243796212|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In243796212, ~z$w_buff1_used~0=~z$w_buff1_used~0_In243796212, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In243796212} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In243796212, ~z$w_buff1_used~0=~z$w_buff1_used~0_In243796212, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out243796212|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In243796212} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 22:08:25,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-381246864 256))) (.cse0 (= ~z$r_buff0_thd3~0_In-381246864 ~z$r_buff0_thd3~0_Out-381246864)) (.cse2 (= (mod ~z$w_buff0_used~0_In-381246864 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-381246864) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-381246864, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-381246864} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-381246864, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-381246864, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-381246864|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 22:08:25,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1901205392 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1901205392 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1901205392 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1901205392 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1901205392|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1901205392 |P2Thread1of1ForFork0_#t~ite54_Out-1901205392|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1901205392, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1901205392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1901205392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1901205392} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1901205392, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1901205392|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1901205392, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1901205392, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1901205392} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 22:08:25,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L821-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_200 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_200, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 22:08:25,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In163250312 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In163250312 |P1Thread1of1ForFork2_#t~ite25_Out163250312|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out163250312| ~z~0_In163250312) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In163250312, ~z$flush_delayed~0=~z$flush_delayed~0_In163250312, ~z~0=~z~0_In163250312} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In163250312, ~z$flush_delayed~0=~z$flush_delayed~0_In163250312, ~z~0=~z~0_In163250312, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out163250312|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 22:08:25,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~z~0_227 |v_P1Thread1of1ForFork2_#t~ite25_90|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_191) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_90|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~z$flush_delayed~0=v_~z$flush_delayed~0_191, ~z~0=v_~z~0_227, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_89|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 22:08:25,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_31 256) 0) (= (mod v_~z$w_buff0_used~0_184 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_31, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_184, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 22:08:25,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out511566985| |ULTIMATE.start_main_#t~ite58_Out511566985|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In511566985 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In511566985 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out511566985| ~z$w_buff1~0_In511566985) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out511566985| ~z~0_In511566985) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511566985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511566985, ~z$w_buff1~0=~z$w_buff1~0_In511566985, ~z~0=~z~0_In511566985} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511566985, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out511566985|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511566985, ~z$w_buff1~0=~z$w_buff1~0_In511566985, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out511566985|, ~z~0=~z~0_In511566985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 22:08:25,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-951932166 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-951932166 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-951932166|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-951932166 |ULTIMATE.start_main_#t~ite60_Out-951932166|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-951932166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-951932166} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-951932166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-951932166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-951932166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 22:08:25,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In222847711 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In222847711 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In222847711 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In222847711 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out222847711|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In222847711 |ULTIMATE.start_main_#t~ite61_Out222847711|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In222847711, ~z$w_buff0_used~0=~z$w_buff0_used~0_In222847711, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In222847711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In222847711} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In222847711, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out222847711|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In222847711, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In222847711, ~z$w_buff1_used~0=~z$w_buff1_used~0_In222847711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 22:08:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1232752788 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1232752788 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-1232752788|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1232752788 |ULTIMATE.start_main_#t~ite62_Out-1232752788|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1232752788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1232752788} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1232752788|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1232752788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1232752788} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 22:08:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1411509713 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1411509713 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1411509713 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1411509713 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1411509713|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite63_Out-1411509713| ~z$r_buff1_thd0~0_In-1411509713)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1411509713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1411509713|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1411509713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 22:08:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_33 0) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~__unbuffered_p2_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_26) (= 1 v_~__unbuffered_p1_EAX~0_52))) 1 0)) 0 1) v_~main$tmp_guard1~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_24 256)) (= v_~z$r_buff1_thd0~0_258 |v_ULTIMATE.start_main_#t~ite63_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 22:08:25,845 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b38c55e1-2161-483e-987c-c1171d8974d9/bin/utaipan/witness.graphml [2019-12-07 22:08:25,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 22:08:25,846 INFO L168 Benchmark]: Toolchain (without parser) took 54713.49 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 938.2 MB in the beginning and 1.6 GB in the end (delta: -614.0 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,846 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:25,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -109.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:25,847 INFO L168 Benchmark]: Boogie Preprocessor took 27.52 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,847 INFO L168 Benchmark]: RCFGBuilder took 435.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.8 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,847 INFO L168 Benchmark]: TraceAbstraction took 53740.02 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 981.8 MB in the beginning and 1.6 GB in the end (delta: -627.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,848 INFO L168 Benchmark]: Witness Printer took 83.10 ms. Allocated memory is still 4.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,849 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -109.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.52 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 435.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.8 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53740.02 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 981.8 MB in the beginning and 1.6 GB in the end (delta: -627.6 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 83.10 ms. Allocated memory is still 4.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 129 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 28 ChoiceCompositions, 9334 VarBasedMoverChecksPositive, 325 VarBasedMoverChecksNegative, 95 SemBasedMoverChecksPositive, 334 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 138188 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t266, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t267, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t268, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5135 SDtfs, 7658 SDslu, 12836 SDs, 0 SdLazy, 2724 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129078occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 184447 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 163717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...