./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_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_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/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 a6e3387ec99167b1127fcbaa99e71913b3e515be ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:51:45,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:51:45,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:51:45,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:51:45,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:51:45,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:51:45,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:51:45,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:51:45,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:51:45,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:51:45,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:51:45,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:51:45,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:51:45,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:51:45,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:51:45,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:51:45,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:51:45,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:51:45,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:51:45,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:51:45,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:51:45,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:51:45,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:51:45,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:51:45,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:51:45,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:51:45,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:51:45,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:51:45,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:51:45,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:51:45,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:51:45,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:51:45,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:51:45,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:51:45,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:51:45,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:51:45,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:51:45,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:51:45,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:51:45,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:51:45,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:51:45,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:51:45,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:51:45,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:51:45,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:51:45,455 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:51:45,456 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:51:45,456 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:51:45,457 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:51:45,457 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:51:45,457 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:51:45,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:51:45,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:51:45,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:51:45,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:51:45,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:51:45,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:51:45,460 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:51:45,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:51:45,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:51:45,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:51:45,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:51:45,460 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_53680041-5a0c-46e5-8be0-04611b7ed228/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 -> a6e3387ec99167b1127fcbaa99e71913b3e515be [2019-12-07 11:51:45,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:51:45,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:51:45,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:51:45,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:51:45,570 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:51:45,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i [2019-12-07 11:51:45,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/data/0ba1248cb/335033d4f4a746afbfc5f905ea641e1b/FLAG077aba39b [2019-12-07 11:51:46,092 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:51:46,093 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/sv-benchmarks/c/pthread-wmm/mix002_pso.opt.i [2019-12-07 11:51:46,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/data/0ba1248cb/335033d4f4a746afbfc5f905ea641e1b/FLAG077aba39b [2019-12-07 11:51:46,112 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/data/0ba1248cb/335033d4f4a746afbfc5f905ea641e1b [2019-12-07 11:51:46,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:51:46,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:51:46,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:51:46,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:51:46,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:51:46,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8e373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46, skipping insertion in model container [2019-12-07 11:51:46,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:51:46,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:51:46,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:51:46,450 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:51:46,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:51:46,538 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:51:46,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46 WrapperNode [2019-12-07 11:51:46,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:51:46,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:51:46,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:51:46,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:51:46,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:51:46,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:51:46,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:51:46,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:51:46,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... [2019-12-07 11:51:46,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:51:46,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:51:46,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:51:46,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:51:46,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:51:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:51:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:51:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:51:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:51:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:51:46,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:51:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:51:46,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:51:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:51:46,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:51:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:51:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:51:46,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:51:46,653 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:51:47,056 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:51:47,057 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:51:47,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:47 BoogieIcfgContainer [2019-12-07 11:51:47,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:51:47,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:51:47,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:51:47,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:51:47,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:51:46" (1/3) ... [2019-12-07 11:51:47,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f9ac6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:51:47, skipping insertion in model container [2019-12-07 11:51:47,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:51:46" (2/3) ... [2019-12-07 11:51:47,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f9ac6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:51:47, skipping insertion in model container [2019-12-07 11:51:47,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:47" (3/3) ... [2019-12-07 11:51:47,062 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.opt.i [2019-12-07 11:51:47,068 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:51:47,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:51:47,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:51:47,075 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:51:47,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:51:47,152 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:51:47,166 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:51:47,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:51:47,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:51:47,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:51:47,166 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:51:47,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:51:47,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:51:47,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:51:47,178 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-07 11:51:47,179 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 11:51:47,255 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 11:51:47,255 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:51:47,268 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:51:47,291 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 11:51:47,335 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 11:51:47,335 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:51:47,344 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:51:47,369 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 11:51:47,370 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:51:50,920 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 11:51:51,159 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 11:51:51,269 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-07 11:51:51,269 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 11:51:51,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 11:51:53,730 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 11:51:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 11:51:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:51:53,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:53,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:53,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-07 11:51:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:53,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371522914] [2019-12-07 11:51:53,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:51:53,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371522914] [2019-12-07 11:51:53,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:53,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:51:53,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874443561] [2019-12-07 11:51:53,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:51:53,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:51:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:53,904 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 11:51:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:54,313 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-07 11:51:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:51:54,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:51:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:54,529 INFO L225 Difference]: With dead ends: 41750 [2019-12-07 11:51:54,529 INFO L226 Difference]: Without dead ends: 38894 [2019-12-07 11:51:54,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:51:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-07 11:51:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-07 11:51:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 11:51:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-07 11:51:55,907 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-07 11:51:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:55,908 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-07 11:51:55,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:51:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-07 11:51:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:51:55,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:55,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:55,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-07 11:51:55,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:55,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205430054] [2019-12-07 11:51:55,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:51:55,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205430054] [2019-12-07 11:51:55,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:55,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:51:55,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384125353] [2019-12-07 11:51:55,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:55,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:55,975 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 4 states. [2019-12-07 11:51:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:56,533 INFO L93 Difference]: Finished difference Result 61966 states and 244788 transitions. [2019-12-07 11:51:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:51:56,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:51:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:56,709 INFO L225 Difference]: With dead ends: 61966 [2019-12-07 11:51:56,709 INFO L226 Difference]: Without dead ends: 61934 [2019-12-07 11:51:56,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:51:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61934 states. [2019-12-07 11:51:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61934 to 60400. [2019-12-07 11:51:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60400 states. [2019-12-07 11:51:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60400 states to 60400 states and 239955 transitions. [2019-12-07 11:51:58,613 INFO L78 Accepts]: Start accepts. Automaton has 60400 states and 239955 transitions. Word has length 13 [2019-12-07 11:51:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:51:58,613 INFO L462 AbstractCegarLoop]: Abstraction has 60400 states and 239955 transitions. [2019-12-07 11:51:58,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:51:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 60400 states and 239955 transitions. [2019-12-07 11:51:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:51:58,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:51:58,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:51:58,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:51:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:51:58,618 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-07 11:51:58,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:51:58,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950770535] [2019-12-07 11:51:58,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:51:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:51:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:51:58,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950770535] [2019-12-07 11:51:58,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:51:58,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:51:58,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2455841] [2019-12-07 11:51:58,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:51:58,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:51:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:51:58,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:51:58,664 INFO L87 Difference]: Start difference. First operand 60400 states and 239955 transitions. Second operand 4 states. [2019-12-07 11:51:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:51:59,141 INFO L93 Difference]: Finished difference Result 76452 states and 299517 transitions. [2019-12-07 11:51:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:51:59,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:51:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:51:59,318 INFO L225 Difference]: With dead ends: 76452 [2019-12-07 11:51:59,318 INFO L226 Difference]: Without dead ends: 76426 [2019-12-07 11:51:59,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76426 states. [2019-12-07 11:52:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76426 to 68802. [2019-12-07 11:52:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68802 states. [2019-12-07 11:52:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68802 states to 68802 states and 271884 transitions. [2019-12-07 11:52:01,144 INFO L78 Accepts]: Start accepts. Automaton has 68802 states and 271884 transitions. Word has length 16 [2019-12-07 11:52:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:01,144 INFO L462 AbstractCegarLoop]: Abstraction has 68802 states and 271884 transitions. [2019-12-07 11:52:01,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 68802 states and 271884 transitions. [2019-12-07 11:52:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:52:01,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:01,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:01,149 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-07 11:52:01,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:01,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959841065] [2019-12-07 11:52:01,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:01,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959841065] [2019-12-07 11:52:01,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:01,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:01,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019276004] [2019-12-07 11:52:01,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:52:01,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:01,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:52:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:01,176 INFO L87 Difference]: Start difference. First operand 68802 states and 271884 transitions. Second operand 3 states. [2019-12-07 11:52:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:01,814 INFO L93 Difference]: Finished difference Result 116968 states and 442545 transitions. [2019-12-07 11:52:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:52:01,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:52:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:02,090 INFO L225 Difference]: With dead ends: 116968 [2019-12-07 11:52:02,090 INFO L226 Difference]: Without dead ends: 116968 [2019-12-07 11:52:02,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116968 states. [2019-12-07 11:52:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116968 to 104212. [2019-12-07 11:52:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104212 states. [2019-12-07 11:52:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104212 states to 104212 states and 399885 transitions. [2019-12-07 11:52:05,964 INFO L78 Accepts]: Start accepts. Automaton has 104212 states and 399885 transitions. Word has length 17 [2019-12-07 11:52:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:05,964 INFO L462 AbstractCegarLoop]: Abstraction has 104212 states and 399885 transitions. [2019-12-07 11:52:05,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 104212 states and 399885 transitions. [2019-12-07 11:52:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:52:05,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:05,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:05,973 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1754315208, now seen corresponding path program 1 times [2019-12-07 11:52:05,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:05,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657454580] [2019-12-07 11:52:05,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:06,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657454580] [2019-12-07 11:52:06,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:06,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:06,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442197561] [2019-12-07 11:52:06,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:52:06,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:06,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:52:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:06,010 INFO L87 Difference]: Start difference. First operand 104212 states and 399885 transitions. Second operand 3 states. [2019-12-07 11:52:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:06,207 INFO L93 Difference]: Finished difference Result 57368 states and 191630 transitions. [2019-12-07 11:52:06,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:52:06,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:52:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:06,315 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 11:52:06,315 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 11:52:06,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 11:52:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 57368. [2019-12-07 11:52:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57368 states. [2019-12-07 11:52:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57368 states to 57368 states and 191630 transitions. [2019-12-07 11:52:07,624 INFO L78 Accepts]: Start accepts. Automaton has 57368 states and 191630 transitions. Word has length 18 [2019-12-07 11:52:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:07,624 INFO L462 AbstractCegarLoop]: Abstraction has 57368 states and 191630 transitions. [2019-12-07 11:52:07,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57368 states and 191630 transitions. [2019-12-07 11:52:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:52:07,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:07,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:07,630 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:07,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1903393538, now seen corresponding path program 1 times [2019-12-07 11:52:07,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953251767] [2019-12-07 11:52:07,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:07,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953251767] [2019-12-07 11:52:07,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:07,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:07,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426719617] [2019-12-07 11:52:07,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:52:07,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:52:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:07,673 INFO L87 Difference]: Start difference. First operand 57368 states and 191630 transitions. Second operand 3 states. [2019-12-07 11:52:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:07,878 INFO L93 Difference]: Finished difference Result 57368 states and 189042 transitions. [2019-12-07 11:52:07,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:52:07,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 11:52:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:07,982 INFO L225 Difference]: With dead ends: 57368 [2019-12-07 11:52:07,982 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 11:52:07,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 11:52:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 56683. [2019-12-07 11:52:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56683 states. [2019-12-07 11:52:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56683 states to 56683 states and 187059 transitions. [2019-12-07 11:52:09,436 INFO L78 Accepts]: Start accepts. Automaton has 56683 states and 187059 transitions. Word has length 19 [2019-12-07 11:52:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:09,436 INFO L462 AbstractCegarLoop]: Abstraction has 56683 states and 187059 transitions. [2019-12-07 11:52:09,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56683 states and 187059 transitions. [2019-12-07 11:52:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:52:09,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:09,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:09,439 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -620191314, now seen corresponding path program 1 times [2019-12-07 11:52:09,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:09,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603416280] [2019-12-07 11:52:09,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:09,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603416280] [2019-12-07 11:52:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:09,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888710113] [2019-12-07 11:52:09,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:09,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:09,469 INFO L87 Difference]: Start difference. First operand 56683 states and 187059 transitions. Second operand 4 states. [2019-12-07 11:52:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:09,498 INFO L93 Difference]: Finished difference Result 8176 states and 22619 transitions. [2019-12-07 11:52:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:52:09,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:52:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:09,508 INFO L225 Difference]: With dead ends: 8176 [2019-12-07 11:52:09,508 INFO L226 Difference]: Without dead ends: 8176 [2019-12-07 11:52:09,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2019-12-07 11:52:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8176. [2019-12-07 11:52:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8176 states. [2019-12-07 11:52:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8176 states to 8176 states and 22619 transitions. [2019-12-07 11:52:09,596 INFO L78 Accepts]: Start accepts. Automaton has 8176 states and 22619 transitions. Word has length 19 [2019-12-07 11:52:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:09,596 INFO L462 AbstractCegarLoop]: Abstraction has 8176 states and 22619 transitions. [2019-12-07 11:52:09,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8176 states and 22619 transitions. [2019-12-07 11:52:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:52:09,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:09,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:09,597 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-07 11:52:09,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:09,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679896767] [2019-12-07 11:52:09,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:09,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679896767] [2019-12-07 11:52:09,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:09,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:52:09,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300752789] [2019-12-07 11:52:09,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:09,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:09,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:09,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:09,627 INFO L87 Difference]: Start difference. First operand 8176 states and 22619 transitions. Second operand 4 states. [2019-12-07 11:52:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:09,795 INFO L93 Difference]: Finished difference Result 10377 states and 28179 transitions. [2019-12-07 11:52:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:09,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:52:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:09,805 INFO L225 Difference]: With dead ends: 10377 [2019-12-07 11:52:09,805 INFO L226 Difference]: Without dead ends: 10377 [2019-12-07 11:52:09,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2019-12-07 11:52:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 8186. [2019-12-07 11:52:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8186 states. [2019-12-07 11:52:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8186 states to 8186 states and 22651 transitions. [2019-12-07 11:52:09,903 INFO L78 Accepts]: Start accepts. Automaton has 8186 states and 22651 transitions. Word has length 19 [2019-12-07 11:52:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:09,903 INFO L462 AbstractCegarLoop]: Abstraction has 8186 states and 22651 transitions. [2019-12-07 11:52:09,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8186 states and 22651 transitions. [2019-12-07 11:52:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:52:09,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:09,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:09,908 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-07 11:52:09,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:09,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204560967] [2019-12-07 11:52:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:09,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204560967] [2019-12-07 11:52:09,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:09,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:09,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067205965] [2019-12-07 11:52:09,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:52:09,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:09,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:52:09,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:09,963 INFO L87 Difference]: Start difference. First operand 8186 states and 22651 transitions. Second operand 5 states. [2019-12-07 11:52:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:10,210 INFO L93 Difference]: Finished difference Result 10954 states and 29336 transitions. [2019-12-07 11:52:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:52:10,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 11:52:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:10,221 INFO L225 Difference]: With dead ends: 10954 [2019-12-07 11:52:10,221 INFO L226 Difference]: Without dead ends: 10953 [2019-12-07 11:52:10,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:52:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10953 states. [2019-12-07 11:52:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10953 to 10182. [2019-12-07 11:52:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-12-07 11:52:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 27669 transitions. [2019-12-07 11:52:10,346 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 27669 transitions. Word has length 31 [2019-12-07 11:52:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:10,346 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 27669 transitions. [2019-12-07 11:52:10,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:52:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 27669 transitions. [2019-12-07 11:52:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:52:10,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:10,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:10,358 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1183609133, now seen corresponding path program 1 times [2019-12-07 11:52:10,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:10,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465145373] [2019-12-07 11:52:10,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:10,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465145373] [2019-12-07 11:52:10,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:10,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:10,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220744251] [2019-12-07 11:52:10,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:52:10,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:52:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:10,387 INFO L87 Difference]: Start difference. First operand 10182 states and 27669 transitions. Second operand 3 states. [2019-12-07 11:52:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:10,447 INFO L93 Difference]: Finished difference Result 10956 states and 28041 transitions. [2019-12-07 11:52:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:52:10,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 11:52:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:10,456 INFO L225 Difference]: With dead ends: 10956 [2019-12-07 11:52:10,456 INFO L226 Difference]: Without dead ends: 10956 [2019-12-07 11:52:10,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:52:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2019-12-07 11:52:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10312. [2019-12-07 11:52:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10312 states. [2019-12-07 11:52:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 26596 transitions. [2019-12-07 11:52:10,567 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 26596 transitions. Word has length 34 [2019-12-07 11:52:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:10,567 INFO L462 AbstractCegarLoop]: Abstraction has 10312 states and 26596 transitions. [2019-12-07 11:52:10,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:52:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 26596 transitions. [2019-12-07 11:52:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:52:10,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:10,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:10,575 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1182175862, now seen corresponding path program 1 times [2019-12-07 11:52:10,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:10,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141426888] [2019-12-07 11:52:10,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:10,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141426888] [2019-12-07 11:52:10,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:10,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:52:10,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313169995] [2019-12-07 11:52:10,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:52:10,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:52:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:10,617 INFO L87 Difference]: Start difference. First operand 10312 states and 26596 transitions. Second operand 5 states. [2019-12-07 11:52:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:10,649 INFO L93 Difference]: Finished difference Result 7816 states and 21181 transitions. [2019-12-07 11:52:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:10,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 11:52:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:10,656 INFO L225 Difference]: With dead ends: 7816 [2019-12-07 11:52:10,656 INFO L226 Difference]: Without dead ends: 7816 [2019-12-07 11:52:10,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7816 states. [2019-12-07 11:52:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7816 to 6702. [2019-12-07 11:52:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2019-12-07 11:52:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 18470 transitions. [2019-12-07 11:52:10,730 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 18470 transitions. Word has length 36 [2019-12-07 11:52:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:10,731 INFO L462 AbstractCegarLoop]: Abstraction has 6702 states and 18470 transitions. [2019-12-07 11:52:10,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:52:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 18470 transitions. [2019-12-07 11:52:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:52:10,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:10,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:10,739 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:10,739 INFO L82 PathProgramCache]: Analyzing trace with hash 14672455, now seen corresponding path program 1 times [2019-12-07 11:52:10,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:10,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328655156] [2019-12-07 11:52:10,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:10,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328655156] [2019-12-07 11:52:10,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:10,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:52:10,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182105259] [2019-12-07 11:52:10,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:10,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:10,816 INFO L87 Difference]: Start difference. First operand 6702 states and 18470 transitions. Second operand 4 states. [2019-12-07 11:52:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:10,987 INFO L93 Difference]: Finished difference Result 7568 states and 20537 transitions. [2019-12-07 11:52:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:52:10,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:52:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:10,994 INFO L225 Difference]: With dead ends: 7568 [2019-12-07 11:52:10,994 INFO L226 Difference]: Without dead ends: 7568 [2019-12-07 11:52:10,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7568 states. [2019-12-07 11:52:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7568 to 7296. [2019-12-07 11:52:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-12-07 11:52:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 19835 transitions. [2019-12-07 11:52:11,074 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 19835 transitions. Word has length 62 [2019-12-07 11:52:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:11,074 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 19835 transitions. [2019-12-07 11:52:11,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 19835 transitions. [2019-12-07 11:52:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:52:11,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:11,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:11,083 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2143606157, now seen corresponding path program 2 times [2019-12-07 11:52:11,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:11,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53798488] [2019-12-07 11:52:11,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:11,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53798488] [2019-12-07 11:52:11,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:11,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:52:11,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660614438] [2019-12-07 11:52:11,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:52:11,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:52:11,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:52:11,165 INFO L87 Difference]: Start difference. First operand 7296 states and 19835 transitions. Second operand 6 states. [2019-12-07 11:52:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:11,457 INFO L93 Difference]: Finished difference Result 7953 states and 21383 transitions. [2019-12-07 11:52:11,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:52:11,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:52:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:11,467 INFO L225 Difference]: With dead ends: 7953 [2019-12-07 11:52:11,467 INFO L226 Difference]: Without dead ends: 7953 [2019-12-07 11:52:11,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:52:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2019-12-07 11:52:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 7466. [2019-12-07 11:52:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-12-07 11:52:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 20190 transitions. [2019-12-07 11:52:11,552 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 20190 transitions. Word has length 62 [2019-12-07 11:52:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:11,553 INFO L462 AbstractCegarLoop]: Abstraction has 7466 states and 20190 transitions. [2019-12-07 11:52:11,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:52:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 20190 transitions. [2019-12-07 11:52:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:52:11,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:11,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:11,562 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2085196129, now seen corresponding path program 3 times [2019-12-07 11:52:11,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:11,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594440880] [2019-12-07 11:52:11,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:11,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594440880] [2019-12-07 11:52:11,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:11,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:52:11,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501965968] [2019-12-07 11:52:11,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:52:11,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:11,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:52:11,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:52:11,636 INFO L87 Difference]: Start difference. First operand 7466 states and 20190 transitions. Second operand 6 states. [2019-12-07 11:52:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:11,910 INFO L93 Difference]: Finished difference Result 9707 states and 26056 transitions. [2019-12-07 11:52:11,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:52:11,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 11:52:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:11,919 INFO L225 Difference]: With dead ends: 9707 [2019-12-07 11:52:11,919 INFO L226 Difference]: Without dead ends: 9707 [2019-12-07 11:52:11,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:52:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2019-12-07 11:52:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 7812. [2019-12-07 11:52:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7812 states. [2019-12-07 11:52:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7812 states to 7812 states and 21115 transitions. [2019-12-07 11:52:12,010 INFO L78 Accepts]: Start accepts. Automaton has 7812 states and 21115 transitions. Word has length 62 [2019-12-07 11:52:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:12,010 INFO L462 AbstractCegarLoop]: Abstraction has 7812 states and 21115 transitions. [2019-12-07 11:52:12,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:52:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7812 states and 21115 transitions. [2019-12-07 11:52:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:52:12,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:12,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:12,019 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1867726925, now seen corresponding path program 4 times [2019-12-07 11:52:12,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:12,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500867755] [2019-12-07 11:52:12,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:12,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500867755] [2019-12-07 11:52:12,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:12,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:52:12,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741004357] [2019-12-07 11:52:12,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:52:12,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:52:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:12,069 INFO L87 Difference]: Start difference. First operand 7812 states and 21115 transitions. Second operand 5 states. [2019-12-07 11:52:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:12,224 INFO L93 Difference]: Finished difference Result 9677 states and 25623 transitions. [2019-12-07 11:52:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:52:12,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 11:52:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:12,233 INFO L225 Difference]: With dead ends: 9677 [2019-12-07 11:52:12,233 INFO L226 Difference]: Without dead ends: 9677 [2019-12-07 11:52:12,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:52:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-12-07 11:52:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8382. [2019-12-07 11:52:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8382 states. [2019-12-07 11:52:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 22522 transitions. [2019-12-07 11:52:12,326 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 22522 transitions. Word has length 62 [2019-12-07 11:52:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:12,326 INFO L462 AbstractCegarLoop]: Abstraction has 8382 states and 22522 transitions. [2019-12-07 11:52:12,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:52:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 22522 transitions. [2019-12-07 11:52:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:12,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:12,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:12,335 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash -390801364, now seen corresponding path program 1 times [2019-12-07 11:52:12,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:12,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746635996] [2019-12-07 11:52:12,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:12,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746635996] [2019-12-07 11:52:12,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:12,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:52:12,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774514877] [2019-12-07 11:52:12,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:52:12,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:52:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:52:12,414 INFO L87 Difference]: Start difference. First operand 8382 states and 22522 transitions. Second operand 6 states. [2019-12-07 11:52:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:12,529 INFO L93 Difference]: Finished difference Result 12791 states and 34514 transitions. [2019-12-07 11:52:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:52:12,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-07 11:52:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:12,539 INFO L225 Difference]: With dead ends: 12791 [2019-12-07 11:52:12,540 INFO L226 Difference]: Without dead ends: 11706 [2019-12-07 11:52:12,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:52:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11706 states. [2019-12-07 11:52:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11706 to 10032. [2019-12-07 11:52:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10032 states. [2019-12-07 11:52:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 26971 transitions. [2019-12-07 11:52:12,650 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 26971 transitions. Word has length 63 [2019-12-07 11:52:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:12,650 INFO L462 AbstractCegarLoop]: Abstraction has 10032 states and 26971 transitions. [2019-12-07 11:52:12,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:52:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 26971 transitions. [2019-12-07 11:52:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:12,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:12,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:12,659 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1785952972, now seen corresponding path program 2 times [2019-12-07 11:52:12,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:12,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532055906] [2019-12-07 11:52:12,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:12,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532055906] [2019-12-07 11:52:12,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:12,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:52:12,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274863882] [2019-12-07 11:52:12,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:52:12,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:52:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:52:12,907 INFO L87 Difference]: Start difference. First operand 10032 states and 26971 transitions. Second operand 12 states. [2019-12-07 11:52:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:13,913 INFO L93 Difference]: Finished difference Result 13068 states and 33401 transitions. [2019-12-07 11:52:13,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 11:52:13,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 11:52:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:13,925 INFO L225 Difference]: With dead ends: 13068 [2019-12-07 11:52:13,925 INFO L226 Difference]: Without dead ends: 12613 [2019-12-07 11:52:13,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:52:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12613 states. [2019-12-07 11:52:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12613 to 10763. [2019-12-07 11:52:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10763 states. [2019-12-07 11:52:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10763 states to 10763 states and 28578 transitions. [2019-12-07 11:52:14,058 INFO L78 Accepts]: Start accepts. Automaton has 10763 states and 28578 transitions. Word has length 63 [2019-12-07 11:52:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:14,058 INFO L462 AbstractCegarLoop]: Abstraction has 10763 states and 28578 transitions. [2019-12-07 11:52:14,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:52:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10763 states and 28578 transitions. [2019-12-07 11:52:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:14,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:14,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:14,067 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -437937848, now seen corresponding path program 3 times [2019-12-07 11:52:14,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:14,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289395398] [2019-12-07 11:52:14,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:14,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289395398] [2019-12-07 11:52:14,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:14,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:14,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730870625] [2019-12-07 11:52:14,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:14,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:14,124 INFO L87 Difference]: Start difference. First operand 10763 states and 28578 transitions. Second operand 4 states. [2019-12-07 11:52:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:14,167 INFO L93 Difference]: Finished difference Result 11633 states and 30458 transitions. [2019-12-07 11:52:14,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:52:14,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 11:52:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:14,173 INFO L225 Difference]: With dead ends: 11633 [2019-12-07 11:52:14,173 INFO L226 Difference]: Without dead ends: 5882 [2019-12-07 11:52:14,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5882 states. [2019-12-07 11:52:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5882 to 5882. [2019-12-07 11:52:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5882 states. [2019-12-07 11:52:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5882 states to 5882 states and 13716 transitions. [2019-12-07 11:52:14,235 INFO L78 Accepts]: Start accepts. Automaton has 5882 states and 13716 transitions. Word has length 63 [2019-12-07 11:52:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:14,235 INFO L462 AbstractCegarLoop]: Abstraction has 5882 states and 13716 transitions. [2019-12-07 11:52:14,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5882 states and 13716 transitions. [2019-12-07 11:52:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:14,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:14,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:14,240 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1580623076, now seen corresponding path program 4 times [2019-12-07 11:52:14,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:14,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864824023] [2019-12-07 11:52:14,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:14,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864824023] [2019-12-07 11:52:14,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:14,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:52:14,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091149061] [2019-12-07 11:52:14,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:52:14,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:52:14,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:52:14,306 INFO L87 Difference]: Start difference. First operand 5882 states and 13716 transitions. Second operand 4 states. [2019-12-07 11:52:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:14,351 INFO L93 Difference]: Finished difference Result 6350 states and 14716 transitions. [2019-12-07 11:52:14,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:14,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 11:52:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:14,357 INFO L225 Difference]: With dead ends: 6350 [2019-12-07 11:52:14,357 INFO L226 Difference]: Without dead ends: 4995 [2019-12-07 11:52:14,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-12-07 11:52:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4577. [2019-12-07 11:52:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4577 states. [2019-12-07 11:52:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 10752 transitions. [2019-12-07 11:52:14,415 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 10752 transitions. Word has length 63 [2019-12-07 11:52:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:14,415 INFO L462 AbstractCegarLoop]: Abstraction has 4577 states and 10752 transitions. [2019-12-07 11:52:14,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:52:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 10752 transitions. [2019-12-07 11:52:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:14,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:14,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:14,418 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash 76538126, now seen corresponding path program 5 times [2019-12-07 11:52:14,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:14,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191016212] [2019-12-07 11:52:14,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:14,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191016212] [2019-12-07 11:52:14,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:14,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:52:14,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968871796] [2019-12-07 11:52:14,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:52:14,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:52:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:52:14,493 INFO L87 Difference]: Start difference. First operand 4577 states and 10752 transitions. Second operand 5 states. [2019-12-07 11:52:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:14,528 INFO L93 Difference]: Finished difference Result 5039 states and 11742 transitions. [2019-12-07 11:52:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:52:14,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 11:52:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:14,529 INFO L225 Difference]: With dead ends: 5039 [2019-12-07 11:52:14,529 INFO L226 Difference]: Without dead ends: 529 [2019-12-07 11:52:14,529 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 11:52:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-07 11:52:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-07 11:52:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-07 11:52:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1082 transitions. [2019-12-07 11:52:14,537 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1082 transitions. Word has length 63 [2019-12-07 11:52:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:14,537 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1082 transitions. [2019-12-07 11:52:14,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:52:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1082 transitions. [2019-12-07 11:52:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:14,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:14,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:14,538 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1862642384, now seen corresponding path program 6 times [2019-12-07 11:52:14,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:14,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100882239] [2019-12-07 11:52:14,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:52:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:52:14,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100882239] [2019-12-07 11:52:14,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:52:14,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:52:14,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977045916] [2019-12-07 11:52:14,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:52:14,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:52:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:52:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:52:14,635 INFO L87 Difference]: Start difference. First operand 529 states and 1082 transitions. Second operand 8 states. [2019-12-07 11:52:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:52:14,804 INFO L93 Difference]: Finished difference Result 1075 states and 2199 transitions. [2019-12-07 11:52:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:52:14,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 11:52:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:52:14,805 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 11:52:14,805 INFO L226 Difference]: Without dead ends: 752 [2019-12-07 11:52:14,805 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 11:52:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-07 11:52:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 606. [2019-12-07 11:52:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-07 11:52:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1216 transitions. [2019-12-07 11:52:14,813 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1216 transitions. Word has length 63 [2019-12-07 11:52:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:52:14,813 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1216 transitions. [2019-12-07 11:52:14,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:52:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1216 transitions. [2019-12-07 11:52:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:52:14,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:52:14,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:52:14,814 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:52:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:52:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 7 times [2019-12-07 11:52:14,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:52:14,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555851112] [2019-12-07 11:52:14,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:52:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:52:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:52:14,879 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:52:14,879 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:52:14,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t47~0.base_132| 4)) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= |v_#valid_167| (store .cse0 |v_ULTIMATE.start_main_~#t47~0.base_132| 1)) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= 0 |v_ULTIMATE.start_main_~#t47~0.offset_73|) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t47~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t47~0.base_132|) |v_ULTIMATE.start_main_~#t47~0.offset_73| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t47~0.base_132|) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t47~0.base_132|) 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t49~0.base=|v_ULTIMATE.start_main_~#t49~0.base_56|, ULTIMATE.start_main_~#t48~0.offset=|v_ULTIMATE.start_main_~#t48~0.offset_35|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t47~0.base=|v_ULTIMATE.start_main_~#t47~0.base_132|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ULTIMATE.start_main_~#t47~0.offset=|v_ULTIMATE.start_main_~#t47~0.offset_73|, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t49~0.offset=|v_ULTIMATE.start_main_~#t49~0.offset_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t48~0.base=|v_ULTIMATE.start_main_~#t48~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t49~0.base, ULTIMATE.start_main_~#t48~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t47~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, 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, ULTIMATE.start_main_~#t47~0.offset, ~x~0, ULTIMATE.start_main_~#t49~0.offset, 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_~#t48~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 11:52:14,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t48~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t48~0.base_10|) |v_ULTIMATE.start_main_~#t48~0.offset_9| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t48~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t48~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t48~0.base_10|) (= |v_ULTIMATE.start_main_~#t48~0.offset_9| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t48~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t48~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t48~0.offset=|v_ULTIMATE.start_main_~#t48~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t48~0.base=|v_ULTIMATE.start_main_~#t48~0.base_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t48~0.offset, ULTIMATE.start_main_~#t48~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:52:14,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t49~0.base_11|) (= |v_ULTIMATE.start_main_~#t49~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t49~0.base_11|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t49~0.base_11| 1) |v_#valid_35|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t49~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t49~0.base_11|) |v_ULTIMATE.start_main_~#t49~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t49~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t49~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t49~0.offset=|v_ULTIMATE.start_main_~#t49~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t49~0.base=|v_ULTIMATE.start_main_~#t49~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t49~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t49~0.base] because there is no mapped edge [2019-12-07 11:52:14,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 11:52:14,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1389877798 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1389877798 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1389877798| |P2Thread1of1ForFork0_#t~ite28_Out-1389877798|))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1389877798| ~z$w_buff0~0_In-1389877798) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~z$w_buff1~0_In-1389877798 |P2Thread1of1ForFork0_#t~ite28_Out-1389877798|) .cse1))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1389877798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1389877798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1389877798, ~z$w_buff1~0=~z$w_buff1~0_In-1389877798} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1389877798|, ~z$w_buff0~0=~z$w_buff0~0_In-1389877798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1389877798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1389877798, ~z$w_buff1~0=~z$w_buff1~0_In-1389877798, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1389877798|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:52:14,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:52:14,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-700908493 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-700908493| ~z$mem_tmp~0_In-700908493) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-700908493| ~z~0_In-700908493)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-700908493, ~z$flush_delayed~0=~z$flush_delayed~0_In-700908493, ~z~0=~z~0_In-700908493} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-700908493|, ~z$mem_tmp~0=~z$mem_tmp~0_In-700908493, ~z$flush_delayed~0=~z$flush_delayed~0_In-700908493, ~z~0=~z~0_In-700908493} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:52:14,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:52:14,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1992437699 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1992437699 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out1992437699| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1992437699 |P2Thread1of1ForFork0_#t~ite51_Out1992437699|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1992437699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1992437699} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1992437699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1992437699, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1992437699|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:52:14,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In690097863 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In690097863 |P1Thread1of1ForFork2_#t~ite25_Out690097863|)) (and .cse0 (= ~z~0_In690097863 |P1Thread1of1ForFork2_#t~ite25_Out690097863|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In690097863, ~z$flush_delayed~0=~z$flush_delayed~0_In690097863, ~z~0=~z~0_In690097863} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In690097863, ~z$flush_delayed~0=~z$flush_delayed~0_In690097863, ~z~0=~z~0_In690097863, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out690097863|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:52:14,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:52:14,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1418986915 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1418986915 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1418986915 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1418986915 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1418986915| ~z$w_buff1_used~0_In-1418986915) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1418986915|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1418986915, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1418986915, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1418986915, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1418986915} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1418986915, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1418986915, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1418986915, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1418986915|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1418986915} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:52:14,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1823493358 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1823493358 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-1823493358 ~z$r_buff0_thd3~0_Out-1823493358))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-1823493358 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1823493358, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1823493358} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1823493358, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1823493358, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1823493358|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:52:14,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-260455409 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-260455409 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-260455409 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-260455409 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-260455409| ~z$r_buff1_thd3~0_In-260455409)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-260455409| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-260455409, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-260455409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-260455409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-260455409} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-260455409, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-260455409|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-260455409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-260455409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-260455409} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:52:14,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:52:14,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:52:14,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1213730481 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1213730481 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1213730481| |ULTIMATE.start_main_#t~ite59_Out1213730481|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out1213730481| ~z$w_buff1~0_In1213730481) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out1213730481| ~z~0_In1213730481) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1213730481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1213730481, ~z$w_buff1~0=~z$w_buff1~0_In1213730481, ~z~0=~z~0_In1213730481} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1213730481, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1213730481|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1213730481, ~z$w_buff1~0=~z$w_buff1~0_In1213730481, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1213730481|, ~z~0=~z~0_In1213730481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:52:14,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1178367931 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1178367931 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1178367931| ~z$w_buff0_used~0_In-1178367931)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-1178367931| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178367931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178367931} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1178367931|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178367931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178367931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:52:14,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2142208211 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2142208211 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2142208211 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2142208211 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-2142208211| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-2142208211 |ULTIMATE.start_main_#t~ite61_Out-2142208211|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2142208211, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142208211, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2142208211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142208211} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2142208211, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2142208211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142208211, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2142208211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142208211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:52:14,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1632823247 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1632823247 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1632823247|)) (and (= ~z$r_buff0_thd0~0_In-1632823247 |ULTIMATE.start_main_#t~ite62_Out-1632823247|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1632823247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632823247} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1632823247|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1632823247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632823247} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:52:14,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1197455325 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1197455325 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1197455325 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1197455325 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1197455325| ~z$r_buff1_thd0~0_In-1197455325) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite63_Out-1197455325| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1197455325, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197455325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1197455325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197455325} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1197455325|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1197455325, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197455325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1197455325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197455325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:52:14,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:52:14,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:52:14 BasicIcfg [2019-12-07 11:52:14,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:52:14,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:52:14,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:52:14,963 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:52:14,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:51:47" (3/4) ... [2019-12-07 11:52:14,965 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:52:14,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t47~0.base_132| 4)) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= |v_#valid_167| (store .cse0 |v_ULTIMATE.start_main_~#t47~0.base_132| 1)) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= 0 |v_ULTIMATE.start_main_~#t47~0.offset_73|) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t47~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t47~0.base_132|) |v_ULTIMATE.start_main_~#t47~0.offset_73| 0)) |v_#memory_int_23|) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t47~0.base_132|) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t47~0.base_132|) 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t49~0.base=|v_ULTIMATE.start_main_~#t49~0.base_56|, ULTIMATE.start_main_~#t48~0.offset=|v_ULTIMATE.start_main_~#t48~0.offset_35|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ULTIMATE.start_main_~#t47~0.base=|v_ULTIMATE.start_main_~#t47~0.base_132|, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ULTIMATE.start_main_~#t47~0.offset=|v_ULTIMATE.start_main_~#t47~0.offset_73|, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t49~0.offset=|v_ULTIMATE.start_main_~#t49~0.offset_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t48~0.base=|v_ULTIMATE.start_main_~#t48~0.base_94|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t49~0.base, ULTIMATE.start_main_~#t48~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t47~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, 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, ULTIMATE.start_main_~#t47~0.offset, ~x~0, ULTIMATE.start_main_~#t49~0.offset, 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_~#t48~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 11:52:14,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t48~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t48~0.base_10|) |v_ULTIMATE.start_main_~#t48~0.offset_9| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t48~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t48~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t48~0.base_10|) (= |v_ULTIMATE.start_main_~#t48~0.offset_9| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t48~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t48~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t48~0.offset=|v_ULTIMATE.start_main_~#t48~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t48~0.base=|v_ULTIMATE.start_main_~#t48~0.base_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t48~0.offset, ULTIMATE.start_main_~#t48~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:52:14,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t49~0.base_11|) (= |v_ULTIMATE.start_main_~#t49~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t49~0.base_11|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t49~0.base_11| 1) |v_#valid_35|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t49~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t49~0.base_11|) |v_ULTIMATE.start_main_~#t49~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t49~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t49~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t49~0.offset=|v_ULTIMATE.start_main_~#t49~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t49~0.base=|v_ULTIMATE.start_main_~#t49~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t49~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t49~0.base] because there is no mapped edge [2019-12-07 11:52:14,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 11:52:14,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1389877798 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1389877798 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out-1389877798| |P2Thread1of1ForFork0_#t~ite28_Out-1389877798|))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1389877798| ~z$w_buff0~0_In-1389877798) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~z$w_buff1~0_In-1389877798 |P2Thread1of1ForFork0_#t~ite28_Out-1389877798|) .cse1))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1389877798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1389877798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1389877798, ~z$w_buff1~0=~z$w_buff1~0_In-1389877798} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1389877798|, ~z$w_buff0~0=~z$w_buff0~0_In-1389877798, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1389877798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1389877798, ~z$w_buff1~0=~z$w_buff1~0_In-1389877798, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1389877798|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:52:14,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:52:14,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-700908493 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-700908493| ~z$mem_tmp~0_In-700908493) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-700908493| ~z~0_In-700908493)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-700908493, ~z$flush_delayed~0=~z$flush_delayed~0_In-700908493, ~z~0=~z~0_In-700908493} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-700908493|, ~z$mem_tmp~0=~z$mem_tmp~0_In-700908493, ~z$flush_delayed~0=~z$flush_delayed~0_In-700908493, ~z~0=~z~0_In-700908493} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:52:14,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:52:14,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1992437699 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1992437699 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out1992437699| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1992437699 |P2Thread1of1ForFork0_#t~ite51_Out1992437699|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1992437699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1992437699} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1992437699, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1992437699, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1992437699|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:52:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In690097863 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In690097863 |P1Thread1of1ForFork2_#t~ite25_Out690097863|)) (and .cse0 (= ~z~0_In690097863 |P1Thread1of1ForFork2_#t~ite25_Out690097863|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In690097863, ~z$flush_delayed~0=~z$flush_delayed~0_In690097863, ~z~0=~z~0_In690097863} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In690097863, ~z$flush_delayed~0=~z$flush_delayed~0_In690097863, ~z~0=~z~0_In690097863, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out690097863|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:52:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:52:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1418986915 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1418986915 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1418986915 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1418986915 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1418986915| ~z$w_buff1_used~0_In-1418986915) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1418986915|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1418986915, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1418986915, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1418986915, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1418986915} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1418986915, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1418986915, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1418986915, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1418986915|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1418986915} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:52:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1823493358 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1823493358 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_In-1823493358 ~z$r_buff0_thd3~0_Out-1823493358))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-1823493358 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1823493358, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1823493358} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1823493358, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1823493358, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1823493358|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:52:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-260455409 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-260455409 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-260455409 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-260455409 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-260455409| ~z$r_buff1_thd3~0_In-260455409)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-260455409| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-260455409, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-260455409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-260455409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-260455409} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-260455409, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-260455409|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-260455409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-260455409, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-260455409} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:52:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:52:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:52:14,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1213730481 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1213730481 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1213730481| |ULTIMATE.start_main_#t~ite59_Out1213730481|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out1213730481| ~z$w_buff1~0_In1213730481) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out1213730481| ~z~0_In1213730481) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1213730481, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1213730481, ~z$w_buff1~0=~z$w_buff1~0_In1213730481, ~z~0=~z~0_In1213730481} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1213730481, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1213730481|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1213730481, ~z$w_buff1~0=~z$w_buff1~0_In1213730481, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1213730481|, ~z~0=~z~0_In1213730481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:52:14,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1178367931 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1178367931 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1178367931| ~z$w_buff0_used~0_In-1178367931)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-1178367931| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178367931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178367931} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1178367931|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1178367931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1178367931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:52:14,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-2142208211 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2142208211 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2142208211 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2142208211 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite61_Out-2142208211| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-2142208211 |ULTIMATE.start_main_#t~ite61_Out-2142208211|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2142208211, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142208211, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2142208211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142208211} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2142208211, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2142208211|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142208211, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2142208211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142208211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:52:14,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1632823247 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1632823247 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1632823247|)) (and (= ~z$r_buff0_thd0~0_In-1632823247 |ULTIMATE.start_main_#t~ite62_Out-1632823247|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1632823247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632823247} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1632823247|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1632823247, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632823247} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:52:14,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1197455325 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1197455325 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1197455325 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1197455325 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1197455325| ~z$r_buff1_thd0~0_In-1197455325) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite63_Out-1197455325| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1197455325, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197455325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1197455325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197455325} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1197455325|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1197455325, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197455325, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1197455325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197455325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:52:14,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:52:15,040 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53680041-5a0c-46e5-8be0-04611b7ed228/bin/utaipan/witness.graphml [2019-12-07 11:52:15,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:52:15,041 INFO L168 Benchmark]: Toolchain (without parser) took 28926.09 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 934.4 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 11:52:15,041 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:52:15,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:52:15,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:52:15,042 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:52:15,042 INFO L168 Benchmark]: RCFGBuilder took 447.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:52:15,042 INFO L168 Benchmark]: TraceAbstraction took 27904.18 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 11:52:15,043 INFO L168 Benchmark]: Witness Printer took 77.44 ms. Allocated memory is still 4.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:52:15,044 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 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 422.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27904.18 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 77.44 ms. Allocated memory is still 4.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t47, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __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] [L847] FCALL, FORK 0 pthread_create(&t48, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __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] [L849] FCALL, FORK 0 pthread_create(&t49, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] 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_p0_EBX=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$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)) [L809] 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_p0_EBX=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] [L809] 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)) [L810] 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_p0_EBX=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] [L810] 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)) [L811] 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_p0_EBX=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] [L811] 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)) [L813] 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_p0_EBX=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] [L813] 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)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L822] 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_p0_EBX=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] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L770] 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=1, __unbuffered_p0_EBX=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] [L822] 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) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 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) [L771] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L771] 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)) [L772] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L772] 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)) [L773] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L773] 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)) [L774] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L774] 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)) [L775] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L775] 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)) [L776] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L776] 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)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L824] 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 [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L855] 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) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 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, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4203 SDtfs, 4614 SDslu, 8619 SDs, 0 SdLazy, 3249 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 37 SyntacticMatches, 13 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104212occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 35356 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 271885 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...