./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_tso.oepc.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_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/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 3a1e4f40f914c6e0d49b332e5985e3ce0c4f5b0e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:58:25,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:58:25,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:58:25,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:58:25,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:58:25,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:58:25,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:58:25,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:58:25,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:58:25,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:58:25,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:58:25,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:58:25,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:58:25,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:58:25,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:58:25,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:58:25,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:58:25,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:58:25,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:58:25,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:58:25,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:58:25,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:58:25,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:58:25,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:58:25,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:58:25,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:58:25,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:58:25,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:58:25,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:58:25,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:58:25,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:58:25,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:58:25,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:58:25,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:58:25,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:58:25,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:58:25,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:58:25,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:58:25,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:58:25,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:58:25,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:58:25,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:58:25,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:58:25,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:58:25,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:58:25,244 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:58:25,244 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:58:25,244 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:58:25,244 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:58:25,244 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:58:25,244 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:58:25,245 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:58:25,245 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:58:25,245 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:58:25,245 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:58:25,245 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:58:25,245 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:58:25,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:58:25,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:58:25,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:58:25,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:58:25,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:58:25,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:58:25,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:58:25,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:58:25,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:58:25,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:58:25,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:58:25,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:58:25,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:58:25,249 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_6d507d07-18ed-4e9e-9763-eae323b3867d/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 -> 3a1e4f40f914c6e0d49b332e5985e3ce0c4f5b0e [2019-12-07 15:58:25,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:58:25,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:58:25,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:58:25,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:58:25,358 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:58:25,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix054_tso.oepc.i [2019-12-07 15:58:25,394 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/data/6eca17f1c/e630095f62cf49989319333a44385d94/FLAGbdca4907a [2019-12-07 15:58:25,837 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:58:25,837 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/sv-benchmarks/c/pthread-wmm/mix054_tso.oepc.i [2019-12-07 15:58:25,847 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/data/6eca17f1c/e630095f62cf49989319333a44385d94/FLAGbdca4907a [2019-12-07 15:58:26,169 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/data/6eca17f1c/e630095f62cf49989319333a44385d94 [2019-12-07 15:58:26,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:58:26,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:58:26,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:58:26,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:58:26,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:58:26,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26, skipping insertion in model container [2019-12-07 15:58:26,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:58:26,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:58:26,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:58:26,496 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:58:26,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:58:26,578 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:58:26,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26 WrapperNode [2019-12-07 15:58:26,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:58:26,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:58:26,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:58:26,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:58:26,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:58:26,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:58:26,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:58:26,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:58:26,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... [2019-12-07 15:58:26,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:58:26,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:58:26,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:58:26,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:58:26,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/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 15:58:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:58:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:58:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:58:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:58:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:58:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:58:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:58:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:58:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:58:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:58:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:58:26,685 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 15:58:27,022 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:58:27,022 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:58:27,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:58:27 BoogieIcfgContainer [2019-12-07 15:58:27,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:58:27,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:58:27,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:58:27,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:58:27,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:58:26" (1/3) ... [2019-12-07 15:58:27,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563c736e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:58:27, skipping insertion in model container [2019-12-07 15:58:27,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:26" (2/3) ... [2019-12-07 15:58:27,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563c736e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:58:27, skipping insertion in model container [2019-12-07 15:58:27,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:58:27" (3/3) ... [2019-12-07 15:58:27,028 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2019-12-07 15:58:27,034 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:58:27,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:58:27,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:58:27,039 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:58:27,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:58:27,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 15:58:27,090 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:58:27,090 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:58:27,090 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:58:27,090 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:58:27,090 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:58:27,090 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:58:27,090 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:58:27,090 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:58:27,101 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-07 15:58:27,102 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 15:58:27,148 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 15:58:27,148 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:58:27,157 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 458 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 15:58:27,168 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 15:58:27,189 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 15:58:27,190 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:58:27,193 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 458 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 15:58:27,201 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-07 15:58:27,202 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:58:29,561 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 15:58:29,643 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-07 15:58:29,643 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-07 15:58:29,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-07 15:58:29,979 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-07 15:58:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-07 15:58:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:58:29,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:29,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:58:29,985 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-07 15:58:29,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:29,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658666187] [2019-12-07 15:58:29,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:30,138 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 15:58:30,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658666187] [2019-12-07 15:58:30,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:30,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:58:30,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773087039] [2019-12-07 15:58:30,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:58:30,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:58:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:58:30,159 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-07 15:58:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:30,331 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-07 15:58:30,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:58:30,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 15:58:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:30,421 INFO L225 Difference]: With dead ends: 8377 [2019-12-07 15:58:30,421 INFO L226 Difference]: Without dead ends: 8208 [2019-12-07 15:58:30,422 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 15:58:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-07 15:58:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-07 15:58:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-07 15:58:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-07 15:58:30,680 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-07 15:58:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:30,681 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-07 15:58:30,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:58:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-07 15:58:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:58:30,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:30,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:30,683 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:30,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-07 15:58:30,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:30,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347730616] [2019-12-07 15:58:30,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:30,757 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 15:58:30,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347730616] [2019-12-07 15:58:30,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:30,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:58:30,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847102871] [2019-12-07 15:58:30,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:30,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:30,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:30,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:30,760 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 4 states. [2019-12-07 15:58:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:30,975 INFO L93 Difference]: Finished difference Result 11151 states and 35424 transitions. [2019-12-07 15:58:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:58:30,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:58:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:31,040 INFO L225 Difference]: With dead ends: 11151 [2019-12-07 15:58:31,040 INFO L226 Difference]: Without dead ends: 11151 [2019-12-07 15:58:31,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:58:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11151 states. [2019-12-07 15:58:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11151 to 10895. [2019-12-07 15:58:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10895 states. [2019-12-07 15:58:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10895 states to 10895 states and 34716 transitions. [2019-12-07 15:58:31,269 INFO L78 Accepts]: Start accepts. Automaton has 10895 states and 34716 transitions. Word has length 11 [2019-12-07 15:58:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:31,269 INFO L462 AbstractCegarLoop]: Abstraction has 10895 states and 34716 transitions. [2019-12-07 15:58:31,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 10895 states and 34716 transitions. [2019-12-07 15:58:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:58:31,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:31,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:31,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-07 15:58:31,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:31,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013717943] [2019-12-07 15:58:31,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:31,324 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 15:58:31,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013717943] [2019-12-07 15:58:31,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:31,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:58:31,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675447570] [2019-12-07 15:58:31,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:31,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:31,325 INFO L87 Difference]: Start difference. First operand 10895 states and 34716 transitions. Second operand 4 states. [2019-12-07 15:58:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:31,575 INFO L93 Difference]: Finished difference Result 15774 states and 49116 transitions. [2019-12-07 15:58:31,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:58:31,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:58:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:31,608 INFO L225 Difference]: With dead ends: 15774 [2019-12-07 15:58:31,608 INFO L226 Difference]: Without dead ends: 15767 [2019-12-07 15:58:31,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:58:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2019-12-07 15:58:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 12980. [2019-12-07 15:58:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12980 states. [2019-12-07 15:58:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12980 states to 12980 states and 41212 transitions. [2019-12-07 15:58:31,868 INFO L78 Accepts]: Start accepts. Automaton has 12980 states and 41212 transitions. Word has length 11 [2019-12-07 15:58:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:31,868 INFO L462 AbstractCegarLoop]: Abstraction has 12980 states and 41212 transitions. [2019-12-07 15:58:31,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 12980 states and 41212 transitions. [2019-12-07 15:58:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:58:31,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:31,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:31,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1818004199, now seen corresponding path program 1 times [2019-12-07 15:58:31,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:31,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005524482] [2019-12-07 15:58:31,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:31,918 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 15:58:31,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005524482] [2019-12-07 15:58:31,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:31,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:58:31,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970093116] [2019-12-07 15:58:31,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:58:31,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:58:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:58:31,920 INFO L87 Difference]: Start difference. First operand 12980 states and 41212 transitions. Second operand 3 states. [2019-12-07 15:58:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:31,928 INFO L93 Difference]: Finished difference Result 1654 states and 3712 transitions. [2019-12-07 15:58:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:58:31,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 15:58:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:31,931 INFO L225 Difference]: With dead ends: 1654 [2019-12-07 15:58:31,931 INFO L226 Difference]: Without dead ends: 1654 [2019-12-07 15:58:31,932 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 15:58:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2019-12-07 15:58:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1654. [2019-12-07 15:58:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-07 15:58:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-07 15:58:31,948 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 17 [2019-12-07 15:58:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:31,948 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-07 15:58:31,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:58:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-07 15:58:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:58:31,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:31,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:31,950 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-07 15:58:31,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:31,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689690390] [2019-12-07 15:58:31,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:32,063 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 15:58:32,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689690390] [2019-12-07 15:58:32,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:32,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:32,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987325377] [2019-12-07 15:58:32,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:58:32,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:58:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:58:32,064 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 5 states. [2019-12-07 15:58:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:32,242 INFO L93 Difference]: Finished difference Result 2088 states and 4578 transitions. [2019-12-07 15:58:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:58:32,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 15:58:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:32,245 INFO L225 Difference]: With dead ends: 2088 [2019-12-07 15:58:32,245 INFO L226 Difference]: Without dead ends: 2088 [2019-12-07 15:58:32,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:58:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2019-12-07 15:58:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1868. [2019-12-07 15:58:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1868 states. [2019-12-07 15:58:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 4151 transitions. [2019-12-07 15:58:32,263 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 4151 transitions. Word has length 23 [2019-12-07 15:58:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:32,264 INFO L462 AbstractCegarLoop]: Abstraction has 1868 states and 4151 transitions. [2019-12-07 15:58:32,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:58:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 4151 transitions. [2019-12-07 15:58:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:58:32,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:32,266 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 15:58:32,266 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -485993864, now seen corresponding path program 1 times [2019-12-07 15:58:32,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:32,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445687614] [2019-12-07 15:58:32,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:32,328 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 15:58:32,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445687614] [2019-12-07 15:58:32,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:32,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:32,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668682860] [2019-12-07 15:58:32,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:32,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:32,329 INFO L87 Difference]: Start difference. First operand 1868 states and 4151 transitions. Second operand 4 states. [2019-12-07 15:58:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:32,338 INFO L93 Difference]: Finished difference Result 374 states and 679 transitions. [2019-12-07 15:58:32,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:32,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 15:58:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:32,339 INFO L225 Difference]: With dead ends: 374 [2019-12-07 15:58:32,339 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 15:58:32,339 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 15:58:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 15:58:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 339. [2019-12-07 15:58:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-07 15:58:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 614 transitions. [2019-12-07 15:58:32,342 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 614 transitions. Word has length 37 [2019-12-07 15:58:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:32,342 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 614 transitions. [2019-12-07 15:58:32,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 614 transitions. [2019-12-07 15:58:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:58:32,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:32,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:32,344 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-07 15:58:32,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:32,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694236215] [2019-12-07 15:58:32,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:32,398 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 15:58:32,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694236215] [2019-12-07 15:58:32,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:32,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:32,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031325692] [2019-12-07 15:58:32,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:58:32,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:58:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:58:32,400 INFO L87 Difference]: Start difference. First operand 339 states and 614 transitions. Second operand 3 states. [2019-12-07 15:58:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:32,434 INFO L93 Difference]: Finished difference Result 352 states and 631 transitions. [2019-12-07 15:58:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:58:32,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 15:58:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:32,435 INFO L225 Difference]: With dead ends: 352 [2019-12-07 15:58:32,435 INFO L226 Difference]: Without dead ends: 352 [2019-12-07 15:58:32,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:58:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-07 15:58:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-12-07 15:58:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 15:58:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 627 transitions. [2019-12-07 15:58:32,440 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 627 transitions. Word has length 52 [2019-12-07 15:58:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:32,442 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 627 transitions. [2019-12-07 15:58:32,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:58:32,442 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 627 transitions. [2019-12-07 15:58:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:58:32,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:32,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:32,444 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-07 15:58:32,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:32,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410371137] [2019-12-07 15:58:32,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:58:32,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410371137] [2019-12-07 15:58:32,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:32,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:58:32,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728985382] [2019-12-07 15:58:32,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:58:32,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:32,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:58:32,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:58:32,517 INFO L87 Difference]: Start difference. First operand 348 states and 627 transitions. Second operand 5 states. [2019-12-07 15:58:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:32,684 INFO L93 Difference]: Finished difference Result 479 states and 863 transitions. [2019-12-07 15:58:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:58:32,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 15:58:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:32,685 INFO L225 Difference]: With dead ends: 479 [2019-12-07 15:58:32,685 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 15:58:32,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:58:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 15:58:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 438. [2019-12-07 15:58:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 15:58:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 791 transitions. [2019-12-07 15:58:32,691 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 791 transitions. Word has length 52 [2019-12-07 15:58:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:32,691 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 791 transitions. [2019-12-07 15:58:32,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:58:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 791 transitions. [2019-12-07 15:58:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:58:32,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:32,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:32,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-07 15:58:32,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:32,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789353363] [2019-12-07 15:58:32,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:32,770 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 15:58:32,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789353363] [2019-12-07 15:58:32,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:32,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:58:32,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148283248] [2019-12-07 15:58:32,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:58:32,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:58:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:58:32,771 INFO L87 Difference]: Start difference. First operand 438 states and 791 transitions. Second operand 6 states. [2019-12-07 15:58:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:32,975 INFO L93 Difference]: Finished difference Result 577 states and 1038 transitions. [2019-12-07 15:58:32,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:58:32,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 15:58:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:32,975 INFO L225 Difference]: With dead ends: 577 [2019-12-07 15:58:32,975 INFO L226 Difference]: Without dead ends: 577 [2019-12-07 15:58:32,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:58:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-07 15:58:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 476. [2019-12-07 15:58:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-07 15:58:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 861 transitions. [2019-12-07 15:58:32,980 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 861 transitions. Word has length 52 [2019-12-07 15:58:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:32,981 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 861 transitions. [2019-12-07 15:58:32,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:58:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 861 transitions. [2019-12-07 15:58:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:58:32,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:32,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:32,982 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-07 15:58:32,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:32,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122445701] [2019-12-07 15:58:32,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:33,050 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 15:58:33,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122445701] [2019-12-07 15:58:33,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:33,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:58:33,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538455641] [2019-12-07 15:58:33,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:58:33,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:58:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:58:33,051 INFO L87 Difference]: Start difference. First operand 476 states and 861 transitions. Second operand 6 states. [2019-12-07 15:58:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:33,240 INFO L93 Difference]: Finished difference Result 715 states and 1297 transitions. [2019-12-07 15:58:33,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:58:33,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 15:58:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:33,241 INFO L225 Difference]: With dead ends: 715 [2019-12-07 15:58:33,241 INFO L226 Difference]: Without dead ends: 715 [2019-12-07 15:58:33,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:58:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-07 15:58:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 517. [2019-12-07 15:58:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-12-07 15:58:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 944 transitions. [2019-12-07 15:58:33,247 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 944 transitions. Word has length 52 [2019-12-07 15:58:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:33,247 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 944 transitions. [2019-12-07 15:58:33,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:58:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 944 transitions. [2019-12-07 15:58:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 15:58:33,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:33,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:33,248 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:33,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-07 15:58:33,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:33,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871624467] [2019-12-07 15:58:33,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:33,319 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 15:58:33,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871624467] [2019-12-07 15:58:33,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:33,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:58:33,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601702301] [2019-12-07 15:58:33,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:58:33,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:33,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:58:33,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:58:33,321 INFO L87 Difference]: Start difference. First operand 517 states and 944 transitions. Second operand 7 states. [2019-12-07 15:58:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:33,541 INFO L93 Difference]: Finished difference Result 772 states and 1396 transitions. [2019-12-07 15:58:33,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:58:33,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 15:58:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:33,541 INFO L225 Difference]: With dead ends: 772 [2019-12-07 15:58:33,542 INFO L226 Difference]: Without dead ends: 772 [2019-12-07 15:58:33,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:58:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-07 15:58:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 503. [2019-12-07 15:58:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-12-07 15:58:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 918 transitions. [2019-12-07 15:58:33,546 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 918 transitions. Word has length 52 [2019-12-07 15:58:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:33,547 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 918 transitions. [2019-12-07 15:58:33,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:58:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 918 transitions. [2019-12-07 15:58:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:58:33,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:33,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:33,548 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-07 15:58:33,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:33,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14319098] [2019-12-07 15:58:33,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:33,647 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 15:58:33,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14319098] [2019-12-07 15:58:33,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:33,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:58:33,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845471233] [2019-12-07 15:58:33,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:58:33,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:58:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:58:33,648 INFO L87 Difference]: Start difference. First operand 503 states and 918 transitions. Second operand 8 states. [2019-12-07 15:58:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:33,963 INFO L93 Difference]: Finished difference Result 788 states and 1383 transitions. [2019-12-07 15:58:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 15:58:33,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-07 15:58:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:33,964 INFO L225 Difference]: With dead ends: 788 [2019-12-07 15:58:33,964 INFO L226 Difference]: Without dead ends: 788 [2019-12-07 15:58:33,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:58:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-12-07 15:58:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 447. [2019-12-07 15:58:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-12-07 15:58:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 796 transitions. [2019-12-07 15:58:33,970 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 796 transitions. Word has length 53 [2019-12-07 15:58:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:33,970 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 796 transitions. [2019-12-07 15:58:33,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:58:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 796 transitions. [2019-12-07 15:58:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:58:33,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:33,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:33,971 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash -162355984, now seen corresponding path program 2 times [2019-12-07 15:58:33,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:33,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904091902] [2019-12-07 15:58:33,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:34,047 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 15:58:34,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904091902] [2019-12-07 15:58:34,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:34,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:58:34,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998152318] [2019-12-07 15:58:34,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:58:34,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:58:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:58:34,048 INFO L87 Difference]: Start difference. First operand 447 states and 796 transitions. Second operand 6 states. [2019-12-07 15:58:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:34,093 INFO L93 Difference]: Finished difference Result 695 states and 1235 transitions. [2019-12-07 15:58:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:58:34,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 15:58:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:34,093 INFO L225 Difference]: With dead ends: 695 [2019-12-07 15:58:34,093 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 15:58:34,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:58:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 15:58:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-12-07 15:58:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-12-07 15:58:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 465 transitions. [2019-12-07 15:58:34,096 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 465 transitions. Word has length 53 [2019-12-07 15:58:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:34,096 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 465 transitions. [2019-12-07 15:58:34,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:58:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 465 transitions. [2019-12-07 15:58:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:58:34,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:34,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:34,097 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1236840700, now seen corresponding path program 3 times [2019-12-07 15:58:34,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:34,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571950588] [2019-12-07 15:58:34,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:34,131 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 15:58:34,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571950588] [2019-12-07 15:58:34,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:34,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:58:34,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879505088] [2019-12-07 15:58:34,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:58:34,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:58:34,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:58:34,132 INFO L87 Difference]: Start difference. First operand 265 states and 465 transitions. Second operand 3 states. [2019-12-07 15:58:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:34,158 INFO L93 Difference]: Finished difference Result 265 states and 464 transitions. [2019-12-07 15:58:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:58:34,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 15:58:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:34,159 INFO L225 Difference]: With dead ends: 265 [2019-12-07 15:58:34,159 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 15:58:34,159 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 15:58:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 15:58:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 207. [2019-12-07 15:58:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 15:58:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 362 transitions. [2019-12-07 15:58:34,161 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 362 transitions. Word has length 53 [2019-12-07 15:58:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:34,162 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 362 transitions. [2019-12-07 15:58:34,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:58:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 362 transitions. [2019-12-07 15:58:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 15:58:34,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:34,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:34,162 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:34,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1571611631, now seen corresponding path program 1 times [2019-12-07 15:58:34,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:34,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126262730] [2019-12-07 15:58:34,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:34,209 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 15:58:34,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126262730] [2019-12-07 15:58:34,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:34,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:58:34,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192220001] [2019-12-07 15:58:34,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:58:34,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:34,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:58:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:58:34,210 INFO L87 Difference]: Start difference. First operand 207 states and 362 transitions. Second operand 3 states. [2019-12-07 15:58:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:34,217 INFO L93 Difference]: Finished difference Result 197 states and 339 transitions. [2019-12-07 15:58:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:58:34,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 15:58:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:34,218 INFO L225 Difference]: With dead ends: 197 [2019-12-07 15:58:34,218 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 15:58:34,219 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 15:58:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 15:58:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-12-07 15:58:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-07 15:58:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 339 transitions. [2019-12-07 15:58:34,221 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 339 transitions. Word has length 53 [2019-12-07 15:58:34,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:34,222 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 339 transitions. [2019-12-07 15:58:34,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:58:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 339 transitions. [2019-12-07 15:58:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 15:58:34,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:34,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:34,223 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 1 times [2019-12-07 15:58:34,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:34,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691290999] [2019-12-07 15:58:34,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:34,374 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 15:58:34,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691290999] [2019-12-07 15:58:34,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:34,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:58:34,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672065797] [2019-12-07 15:58:34,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:58:34,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:58:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:58:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:58:34,375 INFO L87 Difference]: Start difference. First operand 197 states and 339 transitions. Second operand 12 states. [2019-12-07 15:58:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:34,612 INFO L93 Difference]: Finished difference Result 350 states and 592 transitions. [2019-12-07 15:58:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 15:58:34,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-07 15:58:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:34,613 INFO L225 Difference]: With dead ends: 350 [2019-12-07 15:58:34,613 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 15:58:34,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:58:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 15:58:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 305. [2019-12-07 15:58:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-07 15:58:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 524 transitions. [2019-12-07 15:58:34,616 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 524 transitions. Word has length 54 [2019-12-07 15:58:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:34,616 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 524 transitions. [2019-12-07 15:58:34,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:58:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 524 transitions. [2019-12-07 15:58:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 15:58:34,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:34,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:34,617 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:58:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 2 times [2019-12-07 15:58:34,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:58:34,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930497767] [2019-12-07 15:58:34,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:58:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:58:34,677 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:58:34,678 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:58:34,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= 0 v_~x~0_144) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22|)) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1453~0.base_22| 4) |v_#length_15|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22| 1)) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ULTIMATE.start_main_~#t1453~0.offset=|v_ULTIMATE.start_main_~#t1453~0.offset_17|, ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_144, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ULTIMATE.start_main_~#t1453~0.base=|v_ULTIMATE.start_main_~#t1453~0.base_22|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1453~0.offset, ULTIMATE.start_main_~#t1454~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1453~0.base, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:58:34,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1454~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1454~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10|) |v_ULTIMATE.start_main_~#t1454~0.offset_9| 1))) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1454~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10|) 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1454~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1454~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-07 15:58:34,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_15) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_17)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_17 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_15|) (= 2 v_~x$w_buff0~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_15| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_216 256))) (not (= 0 (mod v_~x$w_buff1_used~0_127 256))))) 1 0)) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_17, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_15|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:58:34,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In1178576410 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1178576410 256))) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out1178576410| |P0Thread1of1ForFork0_#t~ite3_Out1178576410|))) (or (and (= ~x$w_buff1~0_In1178576410 |P0Thread1of1ForFork0_#t~ite3_Out1178576410|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~x~0_In1178576410 |P0Thread1of1ForFork0_#t~ite3_Out1178576410|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1178576410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178576410, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1178576410, ~x~0=~x~0_In1178576410} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1178576410|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1178576410|, ~x$w_buff1~0=~x$w_buff1~0_In1178576410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178576410, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1178576410, ~x~0=~x~0_In1178576410} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 15:58:34,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1741620962 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1741620962 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1741620962| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1741620962 |P0Thread1of1ForFork0_#t~ite5_Out1741620962|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741620962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741620962} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1741620962|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741620962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741620962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 15:58:34,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In163587199 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In163587199 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In163587199 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In163587199 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out163587199| ~x$w_buff1_used~0_In163587199) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out163587199| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In163587199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In163587199, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In163587199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out163587199|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In163587199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In163587199, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In163587199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 15:58:34,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1705953047 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1705953047 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1705953047| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1705953047| ~x$w_buff0_used~0_In-1705953047) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705953047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1705953047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705953047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 15:58:34,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-604892641 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-604892641 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-604892641|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-604892641 |P0Thread1of1ForFork0_#t~ite7_Out-604892641|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-604892641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-604892641} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-604892641, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-604892641|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-604892641} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 15:58:34,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-418733261 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-418733261 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-418733261 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-418733261 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-418733261| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-418733261| ~x$r_buff1_thd1~0_In-418733261) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-418733261, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-418733261, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-418733261, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-418733261|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-418733261, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 15:58:34,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 15:58:34,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In734879598 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In734879598 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In734879598 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In734879598 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out734879598|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In734879598 |P1Thread1of1ForFork1_#t~ite12_Out734879598|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In734879598, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In734879598, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In734879598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734879598} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In734879598, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In734879598, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out734879598|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In734879598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734879598} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 15:58:34,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-433219685 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-433219685 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In-433219685 ~x$r_buff0_thd2~0_Out-433219685))) (or (and (= ~x$r_buff0_thd2~0_Out-433219685 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-433219685, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433219685} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-433219685|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-433219685, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433219685} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:58:34,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1556820061 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1556820061 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1556820061 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1556820061 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1556820061| ~x$r_buff1_thd2~0_In1556820061) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1556820061|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1556820061, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556820061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556820061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556820061} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1556820061, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556820061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556820061, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1556820061|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556820061} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 15:58:34,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 15:58:34,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:58:34,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1233088893 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1233088893 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-1233088893| |ULTIMATE.start_main_#t~ite17_Out-1233088893|))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1233088893 |ULTIMATE.start_main_#t~ite17_Out-1233088893|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~x~0_In-1233088893 |ULTIMATE.start_main_#t~ite17_Out-1233088893|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1233088893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1233088893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1233088893, ~x~0=~x~0_In-1233088893} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1233088893|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1233088893|, ~x$w_buff1~0=~x$w_buff1~0_In-1233088893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1233088893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1233088893, ~x~0=~x~0_In-1233088893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-07 15:58:34,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2141093834 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2141093834 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-2141093834|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2141093834 |ULTIMATE.start_main_#t~ite19_Out-2141093834|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2141093834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2141093834} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2141093834, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2141093834|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2141093834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 15:58:34,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2105102848 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2105102848 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2105102848 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2105102848 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-2105102848| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out-2105102848| ~x$w_buff1_used~0_In-2105102848) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2105102848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2105102848, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2105102848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2105102848} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2105102848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2105102848, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2105102848|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2105102848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2105102848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 15:58:34,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-195254479 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-195254479 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-195254479| ~x$r_buff0_thd0~0_In-195254479)) (and (= |ULTIMATE.start_main_#t~ite21_Out-195254479| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-195254479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195254479} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-195254479, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-195254479|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195254479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 15:58:34,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1488278968 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1488278968 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1488278968 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1488278968 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1488278968|)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-1488278968 |ULTIMATE.start_main_#t~ite22_Out-1488278968|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1488278968, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488278968, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488278968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1488278968} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1488278968, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488278968, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488278968, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1488278968|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1488278968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 15:58:34,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-570887200 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-570887200| |ULTIMATE.start_main_#t~ite32_Out-570887200|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-570887200 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-570887200 256))) (= 0 (mod ~x$w_buff0_used~0_In-570887200 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-570887200 256))))) (= ~x$w_buff1~0_In-570887200 |ULTIMATE.start_main_#t~ite31_Out-570887200|) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In-570887200 |ULTIMATE.start_main_#t~ite32_Out-570887200|) (= |ULTIMATE.start_main_#t~ite31_In-570887200| |ULTIMATE.start_main_#t~ite31_Out-570887200|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-570887200, ~x$w_buff1~0=~x$w_buff1~0_In-570887200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-570887200, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-570887200, ~weak$$choice2~0=~weak$$choice2~0_In-570887200, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-570887200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-570887200} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-570887200, ~x$w_buff1~0=~x$w_buff1~0_In-570887200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-570887200, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-570887200|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-570887200, ~weak$$choice2~0=~weak$$choice2~0_In-570887200, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-570887200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-570887200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-07 15:58:34,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 15:58:34,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:58:34,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 15:58:34,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:58:34 BasicIcfg [2019-12-07 15:58:34,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:58:34,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:58:34,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:58:34,732 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:58:34,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:58:27" (3/4) ... [2019-12-07 15:58:34,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:58:34,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= 0 v_~x~0_144) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22|)) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1453~0.base_22| 4) |v_#length_15|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1453~0.base_22| 1)) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1453~0.base_22|) |v_ULTIMATE.start_main_~#t1453~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ULTIMATE.start_main_~#t1453~0.offset=|v_ULTIMATE.start_main_~#t1453~0.offset_17|, ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_144, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_14|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ULTIMATE.start_main_~#t1453~0.base=|v_ULTIMATE.start_main_~#t1453~0.base_22|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1453~0.offset, ULTIMATE.start_main_~#t1454~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1453~0.base, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:58:34,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1454~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1454~0.offset_9| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1454~0.base_10|) |v_ULTIMATE.start_main_~#t1454~0.offset_9| 1))) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1454~0.base_10| 4) |v_#length_9|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1454~0.base_10|) 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1454~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1454~0.base=|v_ULTIMATE.start_main_~#t1454~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1454~0.offset=|v_ULTIMATE.start_main_~#t1454~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1454~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1454~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-07 15:58:34,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_15) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_17)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_17 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_15|) (= 2 v_~x$w_buff0~0_54) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_15| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_216 256))) (not (= 0 (mod v_~x$w_buff1_used~0_127 256))))) 1 0)) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_17, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_15|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:58:34,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In1178576410 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1178576410 256))) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out1178576410| |P0Thread1of1ForFork0_#t~ite3_Out1178576410|))) (or (and (= ~x$w_buff1~0_In1178576410 |P0Thread1of1ForFork0_#t~ite3_Out1178576410|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~x~0_In1178576410 |P0Thread1of1ForFork0_#t~ite3_Out1178576410|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1178576410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178576410, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1178576410, ~x~0=~x~0_In1178576410} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1178576410|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1178576410|, ~x$w_buff1~0=~x$w_buff1~0_In1178576410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1178576410, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1178576410, ~x~0=~x~0_In1178576410} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 15:58:34,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1741620962 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1741620962 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1741620962| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1741620962 |P0Thread1of1ForFork0_#t~ite5_Out1741620962|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741620962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741620962} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1741620962|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1741620962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741620962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 15:58:34,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In163587199 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In163587199 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In163587199 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In163587199 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out163587199| ~x$w_buff1_used~0_In163587199) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite6_Out163587199| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In163587199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In163587199, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In163587199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out163587199|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In163587199, ~x$w_buff1_used~0=~x$w_buff1_used~0_In163587199, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In163587199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In163587199} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 15:58:34,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1705953047 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1705953047 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1705953047| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1705953047| ~x$w_buff0_used~0_In-1705953047) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705953047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1705953047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705953047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705953047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 15:58:34,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-604892641 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-604892641 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-604892641|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-604892641 |P0Thread1of1ForFork0_#t~ite7_Out-604892641|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-604892641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-604892641} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-604892641, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-604892641|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-604892641} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 15:58:34,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-418733261 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-418733261 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-418733261 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-418733261 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-418733261| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-418733261| ~x$r_buff1_thd1~0_In-418733261) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-418733261, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-418733261, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-418733261, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-418733261|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-418733261, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-418733261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-418733261} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 15:58:34,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 15:58:34,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In734879598 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In734879598 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In734879598 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In734879598 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out734879598|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In734879598 |P1Thread1of1ForFork1_#t~ite12_Out734879598|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In734879598, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In734879598, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In734879598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734879598} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In734879598, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In734879598, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out734879598|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In734879598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In734879598} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 15:58:34,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-433219685 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-433219685 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In-433219685 ~x$r_buff0_thd2~0_Out-433219685))) (or (and (= ~x$r_buff0_thd2~0_Out-433219685 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-433219685, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433219685} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-433219685|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-433219685, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-433219685} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:58:34,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1556820061 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1556820061 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1556820061 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1556820061 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1556820061| ~x$r_buff1_thd2~0_In1556820061) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1556820061|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1556820061, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556820061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556820061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556820061} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1556820061, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556820061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556820061, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1556820061|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556820061} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 15:58:34,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 15:58:34,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:58:34,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1233088893 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1233088893 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-1233088893| |ULTIMATE.start_main_#t~ite17_Out-1233088893|))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1233088893 |ULTIMATE.start_main_#t~ite17_Out-1233088893|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~x~0_In-1233088893 |ULTIMATE.start_main_#t~ite17_Out-1233088893|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1233088893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1233088893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1233088893, ~x~0=~x~0_In-1233088893} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1233088893|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1233088893|, ~x$w_buff1~0=~x$w_buff1~0_In-1233088893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1233088893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1233088893, ~x~0=~x~0_In-1233088893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-07 15:58:34,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2141093834 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2141093834 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-2141093834|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2141093834 |ULTIMATE.start_main_#t~ite19_Out-2141093834|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2141093834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2141093834} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2141093834, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2141093834|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2141093834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 15:58:34,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2105102848 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2105102848 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2105102848 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2105102848 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-2105102848| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite20_Out-2105102848| ~x$w_buff1_used~0_In-2105102848) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2105102848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2105102848, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2105102848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2105102848} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2105102848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2105102848, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2105102848|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2105102848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2105102848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 15:58:34,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-195254479 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-195254479 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-195254479| ~x$r_buff0_thd0~0_In-195254479)) (and (= |ULTIMATE.start_main_#t~ite21_Out-195254479| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-195254479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195254479} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-195254479, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-195254479|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-195254479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 15:58:34,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1488278968 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1488278968 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1488278968 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1488278968 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1488278968|)) (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-1488278968 |ULTIMATE.start_main_#t~ite22_Out-1488278968|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1488278968, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488278968, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488278968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1488278968} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1488278968, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488278968, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488278968, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1488278968|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1488278968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 15:58:34,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-570887200 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-570887200| |ULTIMATE.start_main_#t~ite32_Out-570887200|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-570887200 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-570887200 256))) (= 0 (mod ~x$w_buff0_used~0_In-570887200 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-570887200 256))))) (= ~x$w_buff1~0_In-570887200 |ULTIMATE.start_main_#t~ite31_Out-570887200|) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In-570887200 |ULTIMATE.start_main_#t~ite32_Out-570887200|) (= |ULTIMATE.start_main_#t~ite31_In-570887200| |ULTIMATE.start_main_#t~ite31_Out-570887200|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-570887200, ~x$w_buff1~0=~x$w_buff1~0_In-570887200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-570887200, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-570887200, ~weak$$choice2~0=~weak$$choice2~0_In-570887200, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-570887200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-570887200} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-570887200, ~x$w_buff1~0=~x$w_buff1~0_In-570887200, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-570887200, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-570887200|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-570887200, ~weak$$choice2~0=~weak$$choice2~0_In-570887200, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-570887200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-570887200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-07 15:58:34,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 15:58:34,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:58:34,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 15:58:34,795 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6d507d07-18ed-4e9e-9763-eae323b3867d/bin/utaipan/witness.graphml [2019-12-07 15:58:34,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:58:34,796 INFO L168 Benchmark]: Toolchain (without parser) took 8624.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.8 MB). Free memory was 943.5 MB in the beginning and 1.2 GB in the end (delta: -256.9 MB). Peak memory consumption was 148.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:34,797 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:58:34,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:34,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:34,798 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:58:34,798 INFO L168 Benchmark]: RCFGBuilder took 380.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:34,798 INFO L168 Benchmark]: TraceAbstraction took 7707.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 299.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -198.1 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:34,799 INFO L168 Benchmark]: Witness Printer took 63.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:34,800 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7707.54 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 299.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -198.1 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. * Witness Printer took 63.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1738 SDtfs, 1354 SDslu, 3311 SDs, 0 SdLazy, 2274 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 34 SyntacticMatches, 21 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12980occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 4320 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 81782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...