./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/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 6f729b6ce601b7b62788a1137ba803a4071be5ee ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:42:29,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:42:29,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:42:29,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:42:29,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:42:29,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:42:29,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:42:29,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:42:29,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:42:29,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:42:29,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:42:29,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:42:29,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:42:29,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:42:29,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:42:29,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:42:29,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:42:29,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:42:29,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:42:29,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:42:29,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:42:29,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:42:29,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:42:29,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:42:29,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:42:29,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:42:29,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:42:29,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:42:29,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:42:29,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:42:29,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:42:29,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:42:29,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:42:29,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:42:29,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:42:29,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:42:29,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:42:29,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:42:29,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:42:29,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:42:29,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:42:29,117 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:42:29,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:42:29,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:42:29,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:42:29,128 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:42:29,128 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:42:29,129 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:42:29,129 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:42:29,130 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:42:29,130 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:42:29,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:42:29,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:42:29,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:42:29,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:42:29,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:42:29,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:42:29,132 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:42:29,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:42:29,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:42:29,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:42:29,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:42:29,133 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_03c39b11-a370-4337-810a-9d0cddd9b4c8/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 -> 6f729b6ce601b7b62788a1137ba803a4071be5ee [2019-12-07 12:42:29,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:42:29,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:42:29,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:42:29,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:42:29,245 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:42:29,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix013_power.opt.i [2019-12-07 12:42:29,280 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/data/8d5ecaf15/4f7c56250fde41a8b72f4fd743e0608a/FLAG56d952f9e [2019-12-07 12:42:29,785 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:42:29,785 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/sv-benchmarks/c/pthread-wmm/mix013_power.opt.i [2019-12-07 12:42:29,796 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/data/8d5ecaf15/4f7c56250fde41a8b72f4fd743e0608a/FLAG56d952f9e [2019-12-07 12:42:29,806 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/data/8d5ecaf15/4f7c56250fde41a8b72f4fd743e0608a [2019-12-07 12:42:29,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:42:29,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:42:29,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:29,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:42:29,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:42:29,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:29" (1/1) ... [2019-12-07 12:42:29,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:29, skipping insertion in model container [2019-12-07 12:42:29,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:42:29" (1/1) ... [2019-12-07 12:42:29,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:42:29,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:42:30,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:30,154 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:42:30,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:42:30,267 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:42:30,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30 WrapperNode [2019-12-07 12:42:30,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:42:30,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:30,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:42:30,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:42:30,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:42:30,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:42:30,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:42:30,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:42:30,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... [2019-12-07 12:42:30,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:42:30,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:42:30,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:42:30,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:42:30,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:42:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:42:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:42:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:42:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:42:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:42:30,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:42:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:42:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:42:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:42:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:42:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 12:42:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 12:42:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:42:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:42:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:42:30,411 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:42:30,823 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:42:30,824 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:42:30,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:30 BoogieIcfgContainer [2019-12-07 12:42:30,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:42:30,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:42:30,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:42:30,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:42:30,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:42:29" (1/3) ... [2019-12-07 12:42:30,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2050d8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:30, skipping insertion in model container [2019-12-07 12:42:30,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:42:30" (2/3) ... [2019-12-07 12:42:30,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2050d8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:42:30, skipping insertion in model container [2019-12-07 12:42:30,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:30" (3/3) ... [2019-12-07 12:42:30,829 INFO L109 eAbstractionObserver]: Analyzing ICFG mix013_power.opt.i [2019-12-07 12:42:30,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:42:30,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:42:30,841 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:42:30,842 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:42:30,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,873 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,873 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,891 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,891 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,891 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,892 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,892 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,894 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,895 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,896 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,897 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,898 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,899 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,900 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,901 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,902 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,903 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:42:30,922 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 12:42:30,934 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:42:30,934 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:42:30,934 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:42:30,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:42:30,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:42:30,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:42:30,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:42:30,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:42:30,945 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 256 transitions [2019-12-07 12:42:30,946 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 12:42:31,016 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 12:42:31,016 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:42:31,029 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:42:31,051 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 12:42:31,090 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 12:42:31,090 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:42:31,099 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:42:31,125 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 12:42:31,126 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:42:34,968 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 12:42:35,640 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 12:42:35,682 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131114 [2019-12-07 12:42:35,682 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 12:42:35,684 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 12:42:45,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97990 states. [2019-12-07 12:42:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 97990 states. [2019-12-07 12:42:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:42:45,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:45,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:45,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:45,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:45,486 INFO L82 PathProgramCache]: Analyzing trace with hash -904171455, now seen corresponding path program 1 times [2019-12-07 12:42:45,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:45,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792715527] [2019-12-07 12:42:45,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:45,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792715527] [2019-12-07 12:42:45,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:45,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:42:45,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793245793] [2019-12-07 12:42:45,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:42:45,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:42:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:45,660 INFO L87 Difference]: Start difference. First operand 97990 states. Second operand 3 states. [2019-12-07 12:42:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:46,331 INFO L93 Difference]: Finished difference Result 97126 states and 446136 transitions. [2019-12-07 12:42:46,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:42:46,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:42:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:46,881 INFO L225 Difference]: With dead ends: 97126 [2019-12-07 12:42:46,881 INFO L226 Difference]: Without dead ends: 90910 [2019-12-07 12:42:46,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:42:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90910 states. [2019-12-07 12:42:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90910 to 90910. [2019-12-07 12:42:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90910 states. [2019-12-07 12:42:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90910 states to 90910 states and 417332 transitions. [2019-12-07 12:42:52,161 INFO L78 Accepts]: Start accepts. Automaton has 90910 states and 417332 transitions. Word has length 9 [2019-12-07 12:42:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:52,162 INFO L462 AbstractCegarLoop]: Abstraction has 90910 states and 417332 transitions. [2019-12-07 12:42:52,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:42:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 90910 states and 417332 transitions. [2019-12-07 12:42:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:42:52,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:52,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:42:52,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1686431172, now seen corresponding path program 1 times [2019-12-07 12:42:52,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:52,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910038450] [2019-12-07 12:42:52,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:42:52,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910038450] [2019-12-07 12:42:52,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:52,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:52,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138025100] [2019-12-07 12:42:52,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:52,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:52,241 INFO L87 Difference]: Start difference. First operand 90910 states and 417332 transitions. Second operand 4 states. [2019-12-07 12:42:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:53,136 INFO L93 Difference]: Finished difference Result 140998 states and 625524 transitions. [2019-12-07 12:42:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:53,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:42:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:53,560 INFO L225 Difference]: With dead ends: 140998 [2019-12-07 12:42:53,560 INFO L226 Difference]: Without dead ends: 140930 [2019-12-07 12:42:53,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:42:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140930 states. [2019-12-07 12:42:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140930 to 137862. [2019-12-07 12:42:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137862 states. [2019-12-07 12:42:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137862 states to 137862 states and 614280 transitions. [2019-12-07 12:42:58,111 INFO L78 Accepts]: Start accepts. Automaton has 137862 states and 614280 transitions. Word has length 15 [2019-12-07 12:42:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:42:58,111 INFO L462 AbstractCegarLoop]: Abstraction has 137862 states and 614280 transitions. [2019-12-07 12:42:58,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:42:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 137862 states and 614280 transitions. [2019-12-07 12:42:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:42:58,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:42:58,119 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 12:42:58,119 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:42:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:42:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -806058920, now seen corresponding path program 1 times [2019-12-07 12:42:58,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:42:58,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081094743] [2019-12-07 12:42:58,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:42:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:42:58,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 12:42:58,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081094743] [2019-12-07 12:42:58,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:42:58,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:42:58,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389776487] [2019-12-07 12:42:58,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:42:58,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:42:58,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:42:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:42:58,166 INFO L87 Difference]: Start difference. First operand 137862 states and 614280 transitions. Second operand 4 states. [2019-12-07 12:42:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:42:59,421 INFO L93 Difference]: Finished difference Result 175654 states and 773028 transitions. [2019-12-07 12:42:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:42:59,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:42:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:42:59,898 INFO L225 Difference]: With dead ends: 175654 [2019-12-07 12:42:59,898 INFO L226 Difference]: Without dead ends: 175594 [2019-12-07 12:42:59,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175594 states. [2019-12-07 12:43:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175594 to 157746. [2019-12-07 12:43:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157746 states. [2019-12-07 12:43:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157746 states to 157746 states and 699816 transitions. [2019-12-07 12:43:07,060 INFO L78 Accepts]: Start accepts. Automaton has 157746 states and 699816 transitions. Word has length 18 [2019-12-07 12:43:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:07,060 INFO L462 AbstractCegarLoop]: Abstraction has 157746 states and 699816 transitions. [2019-12-07 12:43:07,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 157746 states and 699816 transitions. [2019-12-07 12:43:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:43:07,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:07,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:07,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 363406382, now seen corresponding path program 1 times [2019-12-07 12:43:07,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:07,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474547668] [2019-12-07 12:43:07,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:07,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474547668] [2019-12-07 12:43:07,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:07,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:43:07,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40021347] [2019-12-07 12:43:07,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:07,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:07,158 INFO L87 Difference]: Start difference. First operand 157746 states and 699816 transitions. Second operand 3 states. [2019-12-07 12:43:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:07,884 INFO L93 Difference]: Finished difference Result 155822 states and 688606 transitions. [2019-12-07 12:43:07,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:07,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:43:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:08,321 INFO L225 Difference]: With dead ends: 155822 [2019-12-07 12:43:08,321 INFO L226 Difference]: Without dead ends: 155822 [2019-12-07 12:43:08,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155822 states. [2019-12-07 12:43:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155822 to 155675. [2019-12-07 12:43:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155675 states. [2019-12-07 12:43:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 688262 transitions. [2019-12-07 12:43:16,127 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 688262 transitions. Word has length 20 [2019-12-07 12:43:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:16,128 INFO L462 AbstractCegarLoop]: Abstraction has 155675 states and 688262 transitions. [2019-12-07 12:43:16,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 688262 transitions. [2019-12-07 12:43:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:43:16,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:16,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:16,140 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:16,140 INFO L82 PathProgramCache]: Analyzing trace with hash 811087671, now seen corresponding path program 1 times [2019-12-07 12:43:16,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:16,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438164967] [2019-12-07 12:43:16,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:16,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438164967] [2019-12-07 12:43:16,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:16,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:16,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819446717] [2019-12-07 12:43:16,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:16,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:16,203 INFO L87 Difference]: Start difference. First operand 155675 states and 688262 transitions. Second operand 4 states. [2019-12-07 12:43:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:16,930 INFO L93 Difference]: Finished difference Result 151548 states and 668911 transitions. [2019-12-07 12:43:16,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:43:16,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:43:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:17,339 INFO L225 Difference]: With dead ends: 151548 [2019-12-07 12:43:17,339 INFO L226 Difference]: Without dead ends: 151548 [2019-12-07 12:43:17,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151548 states. [2019-12-07 12:43:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151548 to 151454. [2019-12-07 12:43:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151454 states. [2019-12-07 12:43:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151454 states to 151454 states and 668710 transitions. [2019-12-07 12:43:22,112 INFO L78 Accepts]: Start accepts. Automaton has 151454 states and 668710 transitions. Word has length 21 [2019-12-07 12:43:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:22,112 INFO L462 AbstractCegarLoop]: Abstraction has 151454 states and 668710 transitions. [2019-12-07 12:43:22,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 151454 states and 668710 transitions. [2019-12-07 12:43:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:43:22,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:22,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:22,127 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1655339094, now seen corresponding path program 1 times [2019-12-07 12:43:22,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:22,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261027369] [2019-12-07 12:43:22,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:22,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261027369] [2019-12-07 12:43:22,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:22,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:43:22,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321960487] [2019-12-07 12:43:22,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:22,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:22,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:22,164 INFO L87 Difference]: Start difference. First operand 151454 states and 668710 transitions. Second operand 3 states. [2019-12-07 12:43:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:23,190 INFO L93 Difference]: Finished difference Result 146958 states and 650586 transitions. [2019-12-07 12:43:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:23,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:43:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:23,579 INFO L225 Difference]: With dead ends: 146958 [2019-12-07 12:43:23,579 INFO L226 Difference]: Without dead ends: 146958 [2019-12-07 12:43:23,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146958 states. [2019-12-07 12:43:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146958 to 146958. [2019-12-07 12:43:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146958 states. [2019-12-07 12:43:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146958 states to 146958 states and 650586 transitions. [2019-12-07 12:43:28,257 INFO L78 Accepts]: Start accepts. Automaton has 146958 states and 650586 transitions. Word has length 21 [2019-12-07 12:43:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:28,257 INFO L462 AbstractCegarLoop]: Abstraction has 146958 states and 650586 transitions. [2019-12-07 12:43:28,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 146958 states and 650586 transitions. [2019-12-07 12:43:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:43:28,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:28,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:28,286 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1517939491, now seen corresponding path program 1 times [2019-12-07 12:43:28,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:28,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74155051] [2019-12-07 12:43:28,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:28,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74155051] [2019-12-07 12:43:28,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:28,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:28,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245122336] [2019-12-07 12:43:28,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:28,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:28,329 INFO L87 Difference]: Start difference. First operand 146958 states and 650586 transitions. Second operand 5 states. [2019-12-07 12:43:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:29,575 INFO L93 Difference]: Finished difference Result 173476 states and 759175 transitions. [2019-12-07 12:43:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:43:29,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 12:43:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:30,034 INFO L225 Difference]: With dead ends: 173476 [2019-12-07 12:43:30,034 INFO L226 Difference]: Without dead ends: 173368 [2019-12-07 12:43:30,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:43:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173368 states. [2019-12-07 12:43:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173368 to 146002. [2019-12-07 12:43:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146002 states. [2019-12-07 12:43:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146002 states to 146002 states and 646690 transitions. [2019-12-07 12:43:37,115 INFO L78 Accepts]: Start accepts. Automaton has 146002 states and 646690 transitions. Word has length 24 [2019-12-07 12:43:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:37,116 INFO L462 AbstractCegarLoop]: Abstraction has 146002 states and 646690 transitions. [2019-12-07 12:43:37,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 146002 states and 646690 transitions. [2019-12-07 12:43:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:43:37,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:37,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:37,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash -50185163, now seen corresponding path program 1 times [2019-12-07 12:43:37,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:37,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343573728] [2019-12-07 12:43:37,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:37,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343573728] [2019-12-07 12:43:37,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:37,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:37,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691686728] [2019-12-07 12:43:37,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:37,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:37,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:37,351 INFO L87 Difference]: Start difference. First operand 146002 states and 646690 transitions. Second operand 5 states. [2019-12-07 12:43:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:38,496 INFO L93 Difference]: Finished difference Result 206528 states and 928582 transitions. [2019-12-07 12:43:38,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:43:38,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 12:43:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:39,096 INFO L225 Difference]: With dead ends: 206528 [2019-12-07 12:43:39,096 INFO L226 Difference]: Without dead ends: 206528 [2019-12-07 12:43:39,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:43:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206528 states. [2019-12-07 12:43:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206528 to 197950. [2019-12-07 12:43:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197950 states. [2019-12-07 12:43:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197950 states to 197950 states and 891532 transitions. [2019-12-07 12:43:46,108 INFO L78 Accepts]: Start accepts. Automaton has 197950 states and 891532 transitions. Word has length 35 [2019-12-07 12:43:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:46,109 INFO L462 AbstractCegarLoop]: Abstraction has 197950 states and 891532 transitions. [2019-12-07 12:43:46,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 197950 states and 891532 transitions. [2019-12-07 12:43:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:43:46,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:46,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:46,348 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash 133673921, now seen corresponding path program 2 times [2019-12-07 12:43:46,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:46,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455254662] [2019-12-07 12:43:46,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:46,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:46,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455254662] [2019-12-07 12:43:46,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:46,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:46,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606703494] [2019-12-07 12:43:46,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:46,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:46,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:46,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:46,389 INFO L87 Difference]: Start difference. First operand 197950 states and 891532 transitions. Second operand 3 states. [2019-12-07 12:43:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:47,263 INFO L93 Difference]: Finished difference Result 185378 states and 823502 transitions. [2019-12-07 12:43:47,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:47,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 12:43:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:47,773 INFO L225 Difference]: With dead ends: 185378 [2019-12-07 12:43:47,773 INFO L226 Difference]: Without dead ends: 185378 [2019-12-07 12:43:47,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185378 states. [2019-12-07 12:43:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185378 to 185058. [2019-12-07 12:43:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185058 states. [2019-12-07 12:43:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185058 states to 185058 states and 822334 transitions. [2019-12-07 12:43:55,661 INFO L78 Accepts]: Start accepts. Automaton has 185058 states and 822334 transitions. Word has length 35 [2019-12-07 12:43:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:55,661 INFO L462 AbstractCegarLoop]: Abstraction has 185058 states and 822334 transitions. [2019-12-07 12:43:55,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 185058 states and 822334 transitions. [2019-12-07 12:43:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:43:55,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:55,890 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 12:43:55,890 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash 725427191, now seen corresponding path program 1 times [2019-12-07 12:43:55,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:55,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275356157] [2019-12-07 12:43:55,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:55,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275356157] [2019-12-07 12:43:55,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:55,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:55,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193437059] [2019-12-07 12:43:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:55,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:55,922 INFO L87 Difference]: Start difference. First operand 185058 states and 822334 transitions. Second operand 3 states. [2019-12-07 12:43:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:56,541 INFO L93 Difference]: Finished difference Result 144533 states and 596469 transitions. [2019-12-07 12:43:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:56,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 12:43:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:56,899 INFO L225 Difference]: With dead ends: 144533 [2019-12-07 12:43:56,899 INFO L226 Difference]: Without dead ends: 144533 [2019-12-07 12:43:56,899 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 12:43:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144533 states. [2019-12-07 12:44:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144533 to 144533. [2019-12-07 12:44:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144533 states. [2019-12-07 12:44:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144533 states to 144533 states and 596469 transitions. [2019-12-07 12:44:01,250 INFO L78 Accepts]: Start accepts. Automaton has 144533 states and 596469 transitions. Word has length 36 [2019-12-07 12:44:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:01,250 INFO L462 AbstractCegarLoop]: Abstraction has 144533 states and 596469 transitions. [2019-12-07 12:44:01,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:44:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 144533 states and 596469 transitions. [2019-12-07 12:44:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:44:01,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:01,390 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 12:44:01,390 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash 688100151, now seen corresponding path program 2 times [2019-12-07 12:44:01,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:01,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470562178] [2019-12-07 12:44:01,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:01,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470562178] [2019-12-07 12:44:01,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:44:01,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232452855] [2019-12-07 12:44:01,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:44:01,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:44:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:44:01,489 INFO L87 Difference]: Start difference. First operand 144533 states and 596469 transitions. Second operand 7 states. [2019-12-07 12:44:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:03,196 INFO L93 Difference]: Finished difference Result 218948 states and 903351 transitions. [2019-12-07 12:44:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:44:03,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-07 12:44:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:03,768 INFO L225 Difference]: With dead ends: 218948 [2019-12-07 12:44:03,768 INFO L226 Difference]: Without dead ends: 218948 [2019-12-07 12:44:03,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:44:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218948 states. [2019-12-07 12:44:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218948 to 150563. [2019-12-07 12:44:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150563 states. [2019-12-07 12:44:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150563 states to 150563 states and 623082 transitions. [2019-12-07 12:44:10,932 INFO L78 Accepts]: Start accepts. Automaton has 150563 states and 623082 transitions. Word has length 36 [2019-12-07 12:44:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:10,932 INFO L462 AbstractCegarLoop]: Abstraction has 150563 states and 623082 transitions. [2019-12-07 12:44:10,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:44:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 150563 states and 623082 transitions. [2019-12-07 12:44:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:44:11,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:11,088 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 12:44:11,089 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash 196053183, now seen corresponding path program 3 times [2019-12-07 12:44:11,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:11,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192195334] [2019-12-07 12:44:11,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:11,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192195334] [2019-12-07 12:44:11,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:11,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:11,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104187252] [2019-12-07 12:44:11,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:11,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:11,155 INFO L87 Difference]: Start difference. First operand 150563 states and 623082 transitions. Second operand 4 states. [2019-12-07 12:44:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:12,617 INFO L93 Difference]: Finished difference Result 224318 states and 924816 transitions. [2019-12-07 12:44:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:12,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 12:44:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:13,203 INFO L225 Difference]: With dead ends: 224318 [2019-12-07 12:44:13,203 INFO L226 Difference]: Without dead ends: 224318 [2019-12-07 12:44:13,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224318 states. [2019-12-07 12:44:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224318 to 150793. [2019-12-07 12:44:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150793 states. [2019-12-07 12:44:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150793 states to 150793 states and 616381 transitions. [2019-12-07 12:44:18,360 INFO L78 Accepts]: Start accepts. Automaton has 150793 states and 616381 transitions. Word has length 36 [2019-12-07 12:44:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:18,361 INFO L462 AbstractCegarLoop]: Abstraction has 150793 states and 616381 transitions. [2019-12-07 12:44:18,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 150793 states and 616381 transitions. [2019-12-07 12:44:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:44:18,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:18,510 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 12:44:18,511 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1334365047, now seen corresponding path program 4 times [2019-12-07 12:44:18,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:18,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524811785] [2019-12-07 12:44:18,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:18,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524811785] [2019-12-07 12:44:18,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:18,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:44:18,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825244229] [2019-12-07 12:44:18,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:44:18,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:44:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:44:18,613 INFO L87 Difference]: Start difference. First operand 150793 states and 616381 transitions. Second operand 8 states. [2019-12-07 12:44:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:20,904 INFO L93 Difference]: Finished difference Result 259272 states and 1054694 transitions. [2019-12-07 12:44:20,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:44:20,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 12:44:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:21,507 INFO L225 Difference]: With dead ends: 259272 [2019-12-07 12:44:21,507 INFO L226 Difference]: Without dead ends: 234668 [2019-12-07 12:44:21,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:44:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234668 states. [2019-12-07 12:44:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234668 to 163532. [2019-12-07 12:44:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163532 states. [2019-12-07 12:44:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163532 states to 163532 states and 666370 transitions. [2019-12-07 12:44:29,473 INFO L78 Accepts]: Start accepts. Automaton has 163532 states and 666370 transitions. Word has length 36 [2019-12-07 12:44:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:29,473 INFO L462 AbstractCegarLoop]: Abstraction has 163532 states and 666370 transitions. [2019-12-07 12:44:29,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:44:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 163532 states and 666370 transitions. [2019-12-07 12:44:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:44:29,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:29,649 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 12:44:29,649 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:29,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash -655778039, now seen corresponding path program 5 times [2019-12-07 12:44:29,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:29,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411293554] [2019-12-07 12:44:29,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:29,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411293554] [2019-12-07 12:44:29,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:29,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:44:29,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507270298] [2019-12-07 12:44:29,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:44:29,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:44:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:44:29,720 INFO L87 Difference]: Start difference. First operand 163532 states and 666370 transitions. Second operand 8 states. [2019-12-07 12:44:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:31,512 INFO L93 Difference]: Finished difference Result 256964 states and 1039338 transitions. [2019-12-07 12:44:31,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:44:31,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 12:44:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:32,090 INFO L225 Difference]: With dead ends: 256964 [2019-12-07 12:44:32,090 INFO L226 Difference]: Without dead ends: 237140 [2019-12-07 12:44:32,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:44:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237140 states. [2019-12-07 12:44:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237140 to 172175. [2019-12-07 12:44:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172175 states. [2019-12-07 12:44:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172175 states to 172175 states and 700236 transitions. [2019-12-07 12:44:37,403 INFO L78 Accepts]: Start accepts. Automaton has 172175 states and 700236 transitions. Word has length 36 [2019-12-07 12:44:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:37,404 INFO L462 AbstractCegarLoop]: Abstraction has 172175 states and 700236 transitions. [2019-12-07 12:44:37,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:44:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 172175 states and 700236 transitions. [2019-12-07 12:44:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:44:37,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:37,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:37,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1811485366, now seen corresponding path program 1 times [2019-12-07 12:44:37,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:37,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876296135] [2019-12-07 12:44:37,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:37,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876296135] [2019-12-07 12:44:37,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:37,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:37,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103251067] [2019-12-07 12:44:37,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:37,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:37,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:37,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:37,646 INFO L87 Difference]: Start difference. First operand 172175 states and 700236 transitions. Second operand 4 states. [2019-12-07 12:44:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:38,325 INFO L93 Difference]: Finished difference Result 66938 states and 229857 transitions. [2019-12-07 12:44:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:38,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 12:44:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:38,433 INFO L225 Difference]: With dead ends: 66938 [2019-12-07 12:44:38,433 INFO L226 Difference]: Without dead ends: 66938 [2019-12-07 12:44:38,434 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 12:44:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66938 states. [2019-12-07 12:44:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66938 to 66938. [2019-12-07 12:44:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66938 states. [2019-12-07 12:44:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66938 states to 66938 states and 229857 transitions. [2019-12-07 12:44:39,837 INFO L78 Accepts]: Start accepts. Automaton has 66938 states and 229857 transitions. Word has length 37 [2019-12-07 12:44:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:39,838 INFO L462 AbstractCegarLoop]: Abstraction has 66938 states and 229857 transitions. [2019-12-07 12:44:39,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 66938 states and 229857 transitions. [2019-12-07 12:44:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:44:39,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:39,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:39,892 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -502050099, now seen corresponding path program 1 times [2019-12-07 12:44:39,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:39,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848611902] [2019-12-07 12:44:39,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:39,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848611902] [2019-12-07 12:44:39,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:39,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:39,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819344558] [2019-12-07 12:44:39,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:44:39,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:44:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:39,926 INFO L87 Difference]: Start difference. First operand 66938 states and 229857 transitions. Second operand 5 states. [2019-12-07 12:44:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:39,975 INFO L93 Difference]: Finished difference Result 11543 states and 38167 transitions. [2019-12-07 12:44:39,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:44:39,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 12:44:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:39,990 INFO L225 Difference]: With dead ends: 11543 [2019-12-07 12:44:39,990 INFO L226 Difference]: Without dead ends: 11543 [2019-12-07 12:44:39,990 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 12:44:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11543 states. [2019-12-07 12:44:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11543 to 11543. [2019-12-07 12:44:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11543 states. [2019-12-07 12:44:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 38167 transitions. [2019-12-07 12:44:40,147 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 38167 transitions. Word has length 38 [2019-12-07 12:44:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:40,147 INFO L462 AbstractCegarLoop]: Abstraction has 11543 states and 38167 transitions. [2019-12-07 12:44:40,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:44:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 38167 transitions. [2019-12-07 12:44:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:44:40,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:40,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:40,159 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1651509924, now seen corresponding path program 1 times [2019-12-07 12:44:40,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:40,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825955219] [2019-12-07 12:44:40,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:40,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825955219] [2019-12-07 12:44:40,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:40,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:40,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131278444] [2019-12-07 12:44:40,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:40,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:40,198 INFO L87 Difference]: Start difference. First operand 11543 states and 38167 transitions. Second operand 4 states. [2019-12-07 12:44:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:40,243 INFO L93 Difference]: Finished difference Result 13289 states and 42666 transitions. [2019-12-07 12:44:40,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:40,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 12:44:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:40,258 INFO L225 Difference]: With dead ends: 13289 [2019-12-07 12:44:40,258 INFO L226 Difference]: Without dead ends: 11554 [2019-12-07 12:44:40,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11554 states. [2019-12-07 12:44:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11554 to 11535. [2019-12-07 12:44:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11535 states. [2019-12-07 12:44:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11535 states to 11535 states and 38023 transitions. [2019-12-07 12:44:40,412 INFO L78 Accepts]: Start accepts. Automaton has 11535 states and 38023 transitions. Word has length 49 [2019-12-07 12:44:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:40,412 INFO L462 AbstractCegarLoop]: Abstraction has 11535 states and 38023 transitions. [2019-12-07 12:44:40,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11535 states and 38023 transitions. [2019-12-07 12:44:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:44:40,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:40,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:40,423 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash -87410594, now seen corresponding path program 2 times [2019-12-07 12:44:40,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:40,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730240953] [2019-12-07 12:44:40,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:40,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730240953] [2019-12-07 12:44:40,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:40,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:44:40,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002108424] [2019-12-07 12:44:40,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:44:40,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:40,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:44:40,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:44:40,462 INFO L87 Difference]: Start difference. First operand 11535 states and 38023 transitions. Second operand 6 states. [2019-12-07 12:44:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:40,515 INFO L93 Difference]: Finished difference Result 9934 states and 34396 transitions. [2019-12-07 12:44:40,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:44:40,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 12:44:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:40,523 INFO L225 Difference]: With dead ends: 9934 [2019-12-07 12:44:40,523 INFO L226 Difference]: Without dead ends: 6038 [2019-12-07 12:44:40,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:44:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2019-12-07 12:44:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 6022. [2019-12-07 12:44:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2019-12-07 12:44:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 18773 transitions. [2019-12-07 12:44:40,795 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 18773 transitions. Word has length 49 [2019-12-07 12:44:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:40,795 INFO L462 AbstractCegarLoop]: Abstraction has 6022 states and 18773 transitions. [2019-12-07 12:44:40,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:44:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 18773 transitions. [2019-12-07 12:44:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:44:40,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:40,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:40,801 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -706317618, now seen corresponding path program 1 times [2019-12-07 12:44:40,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:40,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723104304] [2019-12-07 12:44:40,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:40,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723104304] [2019-12-07 12:44:40,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:40,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:40,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629876074] [2019-12-07 12:44:40,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:40,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:40,835 INFO L87 Difference]: Start difference. First operand 6022 states and 18773 transitions. Second operand 4 states. [2019-12-07 12:44:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:40,862 INFO L93 Difference]: Finished difference Result 8978 states and 26528 transitions. [2019-12-07 12:44:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:40,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 12:44:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:40,865 INFO L225 Difference]: With dead ends: 8978 [2019-12-07 12:44:40,866 INFO L226 Difference]: Without dead ends: 3077 [2019-12-07 12:44:40,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-12-07 12:44:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3077. [2019-12-07 12:44:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-12-07 12:44:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 8028 transitions. [2019-12-07 12:44:40,899 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 8028 transitions. Word has length 65 [2019-12-07 12:44:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:40,900 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 8028 transitions. [2019-12-07 12:44:40,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 8028 transitions. [2019-12-07 12:44:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:44:40,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:40,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:40,902 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -244052620, now seen corresponding path program 2 times [2019-12-07 12:44:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:40,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940496747] [2019-12-07 12:44:40,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:40,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940496747] [2019-12-07 12:44:40,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:40,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:40,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018071463] [2019-12-07 12:44:40,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:40,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:40,960 INFO L87 Difference]: Start difference. First operand 3077 states and 8028 transitions. Second operand 4 states. [2019-12-07 12:44:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:40,996 INFO L93 Difference]: Finished difference Result 3498 states and 8990 transitions. [2019-12-07 12:44:40,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:44:40,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 12:44:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:40,999 INFO L225 Difference]: With dead ends: 3498 [2019-12-07 12:44:40,999 INFO L226 Difference]: Without dead ends: 3181 [2019-12-07 12:44:40,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-12-07 12:44:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2807. [2019-12-07 12:44:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2807 states. [2019-12-07 12:44:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 7333 transitions. [2019-12-07 12:44:41,033 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 7333 transitions. Word has length 65 [2019-12-07 12:44:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:41,033 INFO L462 AbstractCegarLoop]: Abstraction has 2807 states and 7333 transitions. [2019-12-07 12:44:41,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 7333 transitions. [2019-12-07 12:44:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:44:41,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:41,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:41,036 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 891950604, now seen corresponding path program 3 times [2019-12-07 12:44:41,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:41,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13789526] [2019-12-07 12:44:41,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:41,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13789526] [2019-12-07 12:44:41,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:41,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:44:41,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774552654] [2019-12-07 12:44:41,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:44:41,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:41,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:44:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:44:41,110 INFO L87 Difference]: Start difference. First operand 2807 states and 7333 transitions. Second operand 7 states. [2019-12-07 12:44:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:41,206 INFO L93 Difference]: Finished difference Result 5326 states and 14177 transitions. [2019-12-07 12:44:41,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:44:41,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 12:44:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:41,209 INFO L225 Difference]: With dead ends: 5326 [2019-12-07 12:44:41,209 INFO L226 Difference]: Without dead ends: 3705 [2019-12-07 12:44:41,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:44:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2019-12-07 12:44:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 2865. [2019-12-07 12:44:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-12-07 12:44:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 7447 transitions. [2019-12-07 12:44:41,240 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 7447 transitions. Word has length 65 [2019-12-07 12:44:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:41,240 INFO L462 AbstractCegarLoop]: Abstraction has 2865 states and 7447 transitions. [2019-12-07 12:44:41,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:44:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 7447 transitions. [2019-12-07 12:44:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:44:41,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:41,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:41,242 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1625949741, now seen corresponding path program 1 times [2019-12-07 12:44:41,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:41,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133665237] [2019-12-07 12:44:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:41,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133665237] [2019-12-07 12:44:41,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:41,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:44:41,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470317786] [2019-12-07 12:44:41,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:44:41,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:41,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:44:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:44:41,318 INFO L87 Difference]: Start difference. First operand 2865 states and 7447 transitions. Second operand 8 states. [2019-12-07 12:44:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:41,593 INFO L93 Difference]: Finished difference Result 6940 states and 18123 transitions. [2019-12-07 12:44:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:44:41,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 12:44:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:41,598 INFO L225 Difference]: With dead ends: 6940 [2019-12-07 12:44:41,598 INFO L226 Difference]: Without dead ends: 5830 [2019-12-07 12:44:41,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:44:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2019-12-07 12:44:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 4314. [2019-12-07 12:44:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4314 states. [2019-12-07 12:44:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 11221 transitions. [2019-12-07 12:44:41,648 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 11221 transitions. Word has length 66 [2019-12-07 12:44:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:41,648 INFO L462 AbstractCegarLoop]: Abstraction has 4314 states and 11221 transitions. [2019-12-07 12:44:41,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:44:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 11221 transitions. [2019-12-07 12:44:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:44:41,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:41,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:41,652 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 249195551, now seen corresponding path program 2 times [2019-12-07 12:44:41,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:41,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733324081] [2019-12-07 12:44:41,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:41,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733324081] [2019-12-07 12:44:41,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:41,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:41,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117919799] [2019-12-07 12:44:41,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:44:41,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:44:41,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:44:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:41,711 INFO L87 Difference]: Start difference. First operand 4314 states and 11221 transitions. Second operand 5 states. [2019-12-07 12:44:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:41,738 INFO L93 Difference]: Finished difference Result 4800 states and 12345 transitions. [2019-12-07 12:44:41,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:44:41,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 12:44:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:41,739 INFO L225 Difference]: With dead ends: 4800 [2019-12-07 12:44:41,739 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 12:44:41,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:44:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 12:44:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 12:44:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 12:44:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1256 transitions. [2019-12-07 12:44:41,744 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1256 transitions. Word has length 66 [2019-12-07 12:44:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:41,744 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1256 transitions. [2019-12-07 12:44:41,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:44:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1256 transitions. [2019-12-07 12:44:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:44:41,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:41,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:41,745 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1220820073, now seen corresponding path program 3 times [2019-12-07 12:44:41,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:44:41,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789585169] [2019-12-07 12:44:41,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:44:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:44:41,827 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:44:41,828 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:44:41,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32|) |v_ULTIMATE.start_main_~#t325~0.offset_23| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t325~0.base_32|) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t325~0.base_32| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~a~0_21 0) (= v_~y~0_64 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32| 1)) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32|) 0) (= 0 v_~z$flush_delayed~0_302) (= |v_ULTIMATE.start_main_~#t325~0.offset_23| 0) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= v_~weak$$choice2~0_349 0) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t325~0.base=|v_ULTIMATE.start_main_~#t325~0.base_32|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_19|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_16|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ~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_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_25|, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t325~0.offset=|v_ULTIMATE.start_main_~#t325~0.offset_23|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_470, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t325~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t328~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_~#t327~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t326~0.base, ~x~0, ULTIMATE.start_main_~#t325~0.offset, ULTIMATE.start_main_~#t328~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t327~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, ~__unbuffered_p3_EBX~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 12:44:41,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t326~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t326~0.base_12|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t326~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12|) |v_ULTIMATE.start_main_~#t326~0.offset_11| 1)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t326~0.offset_11| 0) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t326~0.base] because there is no mapped edge [2019-12-07 12:44:41,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9|) |v_ULTIMATE.start_main_~#t327~0.offset_8| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t327~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t327~0.base_9|)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t327~0.base_9|) (= |v_ULTIMATE.start_main_~#t327~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_8|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t327~0.base, ULTIMATE.start_main_~#t327~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 12:44:41,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= |v_ULTIMATE.start_main_~#t328~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t328~0.base_13|) (= (select |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13|) 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t328~0.base_13| 4)) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13|) |v_ULTIMATE.start_main_~#t328~0.offset_11| 3)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t328~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t328~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t328~0.base, #length] because there is no mapped edge [2019-12-07 12:44:41,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 12:44:41,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1838856697 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1838856697 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite29_Out-1838856697| |P3Thread1of1ForFork3_#t~ite28_Out-1838856697|))) (or (and (or .cse0 .cse1) (= ~z$w_buff1~0_In-1838856697 |P3Thread1of1ForFork3_#t~ite28_Out-1838856697|) .cse2) (and (not .cse0) (= ~z$w_buff0~0_In-1838856697 |P3Thread1of1ForFork3_#t~ite28_Out-1838856697|) (not .cse1) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1838856697, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1838856697, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1838856697, ~z$w_buff1~0=~z$w_buff1~0_In-1838856697} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out-1838856697|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out-1838856697|, ~z$w_buff0~0=~z$w_buff0~0_In-1838856697, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1838856697, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1838856697, ~z$w_buff1~0=~z$w_buff1~0_In-1838856697} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 12:44:41,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:44:41,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1458060784 256)))) (or (and (= ~z~0_In1458060784 |P3Thread1of1ForFork3_#t~ite48_Out1458060784|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite48_Out1458060784| ~z$mem_tmp~0_In1458060784)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1458060784, ~z$flush_delayed~0=~z$flush_delayed~0_In1458060784, ~z~0=~z~0_In1458060784} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1458060784, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out1458060784|, ~z$flush_delayed~0=~z$flush_delayed~0_In1458060784, ~z~0=~z~0_In1458060784} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 12:44:41,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:44:41,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:44:41,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In781495581 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In781495581 |P2Thread1of1ForFork2_#t~ite25_Out781495581|)) (and .cse0 (= ~z~0_In781495581 |P2Thread1of1ForFork2_#t~ite25_Out781495581|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In781495581, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In781495581, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out781495581|, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:44:41,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:44:41,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1266637219 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1266637219 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite51_Out1266637219| 0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite51_Out1266637219| ~z$w_buff0_used~0_In1266637219) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out1266637219|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 12:44:41,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1961879324 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1961879324 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1961879324 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1961879324 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite52_Out1961879324| ~z$w_buff1_used~0_In1961879324)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite52_Out1961879324| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1961879324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1961879324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961879324} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out1961879324|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1961879324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1961879324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961879324} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 12:44:41,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In493732174 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In493732174 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_Out493732174 ~z$r_buff0_thd4~0_In493732174))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out493732174) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In493732174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In493732174} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out493732174|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In493732174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out493732174} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:44:41,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1601207480 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1601207480 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1601207480 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1601207480 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite54_Out-1601207480| ~z$r_buff1_thd4~0_In-1601207480) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite54_Out-1601207480| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1601207480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1601207480, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1601207480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601207480} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out-1601207480|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1601207480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1601207480, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1601207480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601207480} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 12:44:41,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 12:44:41,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:44:41,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1024315140 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1024315140 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In1024315140 |ULTIMATE.start_main_#t~ite59_Out1024315140|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1024315140| ~z~0_In1024315140)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1024315140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1024315140, ~z$w_buff1~0=~z$w_buff1~0_In1024315140, ~z~0=~z~0_In1024315140} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1024315140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1024315140, ~z$w_buff1~0=~z$w_buff1~0_In1024315140, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1024315140|, ~z~0=~z~0_In1024315140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:44:41,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 12:44:41,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1537899347 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1537899347 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1537899347| ~z$w_buff0_used~0_In-1537899347) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1537899347| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1537899347, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537899347} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1537899347, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1537899347|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537899347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:44:41,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In591581021 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In591581021 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In591581021 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In591581021 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out591581021|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out591581021| ~z$w_buff1_used~0_In591581021)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In591581021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In591581021, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In591581021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In591581021} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out591581021|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In591581021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In591581021, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In591581021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In591581021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:44:41,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1110930312 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1110930312 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1110930312 |ULTIMATE.start_main_#t~ite63_Out1110930312|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out1110930312|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1110930312|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:44:41,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1337569921 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1337569921 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1337569921 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1337569921 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1337569921|)) (and (= |ULTIMATE.start_main_#t~ite64_Out1337569921| ~z$r_buff1_thd0~0_In1337569921) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1337569921, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1337569921, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1337569921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337569921} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1337569921, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1337569921, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1337569921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337569921, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1337569921|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:44:41,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:44:41,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:44:41 BasicIcfg [2019-12-07 12:44:41,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:44:41,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:44:41,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:44:41,934 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:44:41,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:42:30" (3/4) ... [2019-12-07 12:44:41,936 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:44:41,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32|) |v_ULTIMATE.start_main_~#t325~0.offset_23| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t325~0.base_32|) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t325~0.base_32| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~a~0_21 0) (= v_~y~0_64 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32| 1)) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32|) 0) (= 0 v_~z$flush_delayed~0_302) (= |v_ULTIMATE.start_main_~#t325~0.offset_23| 0) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= v_~weak$$choice2~0_349 0) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t325~0.base=|v_ULTIMATE.start_main_~#t325~0.base_32|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_19|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_16|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ~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_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_25|, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t325~0.offset=|v_ULTIMATE.start_main_~#t325~0.offset_23|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_470, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t325~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t328~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_~#t327~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t326~0.base, ~x~0, ULTIMATE.start_main_~#t325~0.offset, ULTIMATE.start_main_~#t328~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t327~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, ~__unbuffered_p3_EBX~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 12:44:41,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t326~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t326~0.base_12|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t326~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12|) |v_ULTIMATE.start_main_~#t326~0.offset_11| 1)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t326~0.offset_11| 0) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t326~0.base] because there is no mapped edge [2019-12-07 12:44:41,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9|) |v_ULTIMATE.start_main_~#t327~0.offset_8| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t327~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t327~0.base_9|)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t327~0.base_9|) (= |v_ULTIMATE.start_main_~#t327~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_8|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t327~0.base, ULTIMATE.start_main_~#t327~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 12:44:41,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= |v_ULTIMATE.start_main_~#t328~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t328~0.base_13|) (= (select |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13|) 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t328~0.base_13| 4)) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13|) |v_ULTIMATE.start_main_~#t328~0.offset_11| 3)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t328~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t328~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t328~0.base, #length] because there is no mapped edge [2019-12-07 12:44:41,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 12:44:41,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1838856697 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1838856697 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite29_Out-1838856697| |P3Thread1of1ForFork3_#t~ite28_Out-1838856697|))) (or (and (or .cse0 .cse1) (= ~z$w_buff1~0_In-1838856697 |P3Thread1of1ForFork3_#t~ite28_Out-1838856697|) .cse2) (and (not .cse0) (= ~z$w_buff0~0_In-1838856697 |P3Thread1of1ForFork3_#t~ite28_Out-1838856697|) (not .cse1) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1838856697, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1838856697, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1838856697, ~z$w_buff1~0=~z$w_buff1~0_In-1838856697} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out-1838856697|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out-1838856697|, ~z$w_buff0~0=~z$w_buff0~0_In-1838856697, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1838856697, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1838856697, ~z$w_buff1~0=~z$w_buff1~0_In-1838856697} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 12:44:41,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:44:41,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1458060784 256)))) (or (and (= ~z~0_In1458060784 |P3Thread1of1ForFork3_#t~ite48_Out1458060784|) .cse0) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite48_Out1458060784| ~z$mem_tmp~0_In1458060784)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1458060784, ~z$flush_delayed~0=~z$flush_delayed~0_In1458060784, ~z~0=~z~0_In1458060784} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1458060784, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out1458060784|, ~z$flush_delayed~0=~z$flush_delayed~0_In1458060784, ~z~0=~z~0_In1458060784} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 12:44:41,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:44:41,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:44:41,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In781495581 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In781495581 |P2Thread1of1ForFork2_#t~ite25_Out781495581|)) (and .cse0 (= ~z~0_In781495581 |P2Thread1of1ForFork2_#t~ite25_Out781495581|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In781495581, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In781495581, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out781495581|, ~z$flush_delayed~0=~z$flush_delayed~0_In781495581, ~z~0=~z~0_In781495581} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:44:41,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:44:41,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1266637219 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1266637219 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite51_Out1266637219| 0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite51_Out1266637219| ~z$w_buff0_used~0_In1266637219) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out1266637219|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1266637219, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1266637219} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 12:44:41,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1961879324 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1961879324 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1961879324 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1961879324 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite52_Out1961879324| ~z$w_buff1_used~0_In1961879324)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite52_Out1961879324| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1961879324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1961879324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961879324} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out1961879324|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1961879324, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1961879324, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1961879324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1961879324} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In493732174 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In493732174 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_Out493732174 ~z$r_buff0_thd4~0_In493732174))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out493732174) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In493732174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In493732174} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out493732174|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In493732174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out493732174} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1601207480 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1601207480 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1601207480 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1601207480 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite54_Out-1601207480| ~z$r_buff1_thd4~0_In-1601207480) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork3_#t~ite54_Out-1601207480| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1601207480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1601207480, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1601207480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601207480} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out-1601207480|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1601207480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1601207480, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1601207480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1601207480} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1024315140 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1024315140 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In1024315140 |ULTIMATE.start_main_#t~ite59_Out1024315140|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1024315140| ~z~0_In1024315140)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1024315140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1024315140, ~z$w_buff1~0=~z$w_buff1~0_In1024315140, ~z~0=~z~0_In1024315140} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1024315140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1024315140, ~z$w_buff1~0=~z$w_buff1~0_In1024315140, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1024315140|, ~z~0=~z~0_In1024315140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 12:44:41,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1537899347 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1537899347 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1537899347| ~z$w_buff0_used~0_In-1537899347) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1537899347| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1537899347, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537899347} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1537899347, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1537899347|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537899347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:44:41,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In591581021 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In591581021 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In591581021 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In591581021 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out591581021|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out591581021| ~z$w_buff1_used~0_In591581021)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In591581021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In591581021, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In591581021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In591581021} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out591581021|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In591581021, ~z$w_buff0_used~0=~z$w_buff0_used~0_In591581021, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In591581021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In591581021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:44:41,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1110930312 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1110930312 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1110930312 |ULTIMATE.start_main_#t~ite63_Out1110930312|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out1110930312|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1110930312|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1110930312, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1110930312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:44:41,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1337569921 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1337569921 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1337569921 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1337569921 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1337569921|)) (and (= |ULTIMATE.start_main_#t~ite64_Out1337569921| ~z$r_buff1_thd0~0_In1337569921) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1337569921, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1337569921, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1337569921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337569921} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1337569921, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1337569921, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1337569921, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1337569921, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1337569921|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:44:41,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:44:42,026 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_03c39b11-a370-4337-810a-9d0cddd9b4c8/bin/utaipan/witness.graphml [2019-12-07 12:44:42,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:44:42,028 INFO L168 Benchmark]: Toolchain (without parser) took 132219.61 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 939.3 MB in the beginning and 5.2 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,028 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:44:42,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -108.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,029 INFO L168 Benchmark]: Boogie Preprocessor took 35.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,030 INFO L168 Benchmark]: RCFGBuilder took 465.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.1 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,030 INFO L168 Benchmark]: TraceAbstraction took 131107.93 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 981.1 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,031 INFO L168 Benchmark]: Witness Printer took 93.36 ms. Allocated memory is still 8.1 GB. Free memory was 5.3 GB in the beginning and 5.2 GB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:42,032 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 459.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -108.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 981.1 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 131107.93 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 981.1 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 93.36 ms. Allocated memory is still 8.1 GB. Free memory was 5.3 GB in the beginning and 5.2 GB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 213 ProgramPointsBefore, 115 ProgramPointsAfterwards, 256 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 11402 VarBasedMoverChecksPositive, 391 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 392 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 131114 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L858] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = z$w_buff0 [L804] 4 z$w_buff0 = 1 [L805] 4 z$w_buff1_used = z$w_buff0_used [L806] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$flush_delayed ? z$mem_tmp : z [L829] 4 z$flush_delayed = (_Bool)0 [L832] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 y = 1 [L778] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 3 z$flush_delayed = weak$$choice2 [L781] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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) [L783] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 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)) [L785] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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)) [L786] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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)) [L787] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L788] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 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)) [L789] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L870] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 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 [L873] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 201 locations, 2 error locations. Result: UNSAFE, OverallTime: 130.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5137 SDtfs, 7284 SDslu, 10985 SDs, 0 SdLazy, 3895 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197950occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 88.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 338197 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 249165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...