./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_power.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_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/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 d2e090f7e83a575d605535d45cb53c24f4de9fdf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:25:25,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:25:25,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:25:25,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:25:25,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:25:25,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:25:25,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:25:25,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:25:25,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:25:25,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:25:25,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:25:25,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:25:25,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:25:25,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:25:25,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:25:25,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:25:25,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:25:25,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:25:25,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:25:25,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:25:25,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:25:25,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:25:25,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:25:25,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:25:25,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:25:25,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:25:25,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:25:25,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:25:25,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:25:25,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:25:25,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:25:25,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:25:25,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:25:25,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:25:25,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:25:25,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:25:25,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:25:25,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:25:25,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:25:25,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:25:25,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:25:25,227 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:25:25,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:25:25,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:25:25,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:25:25,237 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:25:25,237 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:25:25,238 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:25:25,238 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:25:25,239 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:25:25,239 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:25:25,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:25:25,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:25:25,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:25:25,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:25:25,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:25:25,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:25:25,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:25:25,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:25:25,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:25:25,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:25:25,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:25:25,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:25:25,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:25:25,242 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:25:25,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:25:25,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:25:25,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:25:25,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:25:25,242 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_2fc83929-db95-4f5b-b835-ee73b9c49c09/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 -> d2e090f7e83a575d605535d45cb53c24f4de9fdf [2019-12-07 20:25:25,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:25:25,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:25:25,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:25:25,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:25:25,357 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:25:25,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i [2019-12-07 20:25:25,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/data/5138805ff/db43818a0b8d48409757e3c71e3b2264/FLAG362e186a2 [2019-12-07 20:25:25,867 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:25:25,868 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i [2019-12-07 20:25:25,877 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/data/5138805ff/db43818a0b8d48409757e3c71e3b2264/FLAG362e186a2 [2019-12-07 20:25:25,889 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/data/5138805ff/db43818a0b8d48409757e3c71e3b2264 [2019-12-07 20:25:25,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:25:25,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:25:25,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:25:25,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:25:25,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:25:25,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:25:25" (1/1) ... [2019-12-07 20:25:25,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:25, skipping insertion in model container [2019-12-07 20:25:25,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:25:25" (1/1) ... [2019-12-07 20:25:25,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:25:25,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:25:26,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:25:26,190 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:25:26,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:25:26,279 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:25:26,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26 WrapperNode [2019-12-07 20:25:26,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:25:26,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:25:26,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:25:26,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:25:26,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:25:26,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:25:26,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:25:26,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:25:26,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... [2019-12-07 20:25:26,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:25:26,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:25:26,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:25:26,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:25:26,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/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 20:25:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:25:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:25:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:25:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:25:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:25:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:25:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:25:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:25:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:25:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:25:26,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:25:26,395 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 20:25:26,746 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:25:26,746 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:25:26,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:25:26 BoogieIcfgContainer [2019-12-07 20:25:26,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:25:26,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:25:26,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:25:26,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:25:26,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:25:25" (1/3) ... [2019-12-07 20:25:26,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db49359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:25:26, skipping insertion in model container [2019-12-07 20:25:26,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:25:26" (2/3) ... [2019-12-07 20:25:26,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db49359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:25:26, skipping insertion in model container [2019-12-07 20:25:26,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:25:26" (3/3) ... [2019-12-07 20:25:26,753 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-07 20:25:26,759 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:25:26,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:25:26,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:25:26,764 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:25:26,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,793 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:25:26,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 20:25:26,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:25:26,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:25:26,837 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:25:26,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:25:26,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:25:26,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:25:26,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:25:26,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:25:26,848 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 20:25:26,849 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 20:25:26,908 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 20:25:26,908 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:25:26,916 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 20:25:26,928 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 20:25:26,960 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 20:25:26,961 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:25:26,965 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 20:25:26,975 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 20:25:26,976 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:25:29,725 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 20:25:29,811 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 20:25:29,811 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 20:25:29,813 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 20:25:30,120 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 20:25:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 20:25:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:25:30,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:30,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:25:30,126 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 20:25:30,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:30,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597159366] [2019-12-07 20:25:30,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:30,265 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 20:25:30,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597159366] [2019-12-07 20:25:30,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:30,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:25:30,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875517017] [2019-12-07 20:25:30,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:25:30,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:25:30,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:25:30,281 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 20:25:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:30,444 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 20:25:30,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:25:30,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:25:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:30,503 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 20:25:30,504 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 20:25:30,504 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 20:25:30,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 20:25:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 20:25:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 20:25:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 20:25:30,783 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 20:25:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:30,784 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 20:25:30,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:25:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 20:25:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:25:30,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:30,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:25:30,786 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 20:25:30,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:30,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184678398] [2019-12-07 20:25:30,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:30,844 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 20:25:30,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184678398] [2019-12-07 20:25:30,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:30,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:25:30,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134888934] [2019-12-07 20:25:30,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:25:30,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:25:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:25:30,846 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 20:25:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:31,100 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-07 20:25:31,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:25:31,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:25:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:31,162 INFO L225 Difference]: With dead ends: 12178 [2019-12-07 20:25:31,162 INFO L226 Difference]: Without dead ends: 12171 [2019-12-07 20:25:31,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:25:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-07 20:25:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-07 20:25:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-07 20:25:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-07 20:25:31,434 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-07 20:25:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:31,434 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-07 20:25:31,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:25:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-07 20:25:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:25:31,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:31,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:25:31,440 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 20:25:31,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:31,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811210084] [2019-12-07 20:25:31,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:31,510 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 20:25:31,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811210084] [2019-12-07 20:25:31,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:31,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:25:31,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167028486] [2019-12-07 20:25:31,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:25:31,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:25:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:25:31,511 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-07 20:25:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:31,658 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-07 20:25:31,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:25:31,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 20:25:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:31,694 INFO L225 Difference]: With dead ends: 13366 [2019-12-07 20:25:31,694 INFO L226 Difference]: Without dead ends: 13366 [2019-12-07 20:25:31,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:25:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-07 20:25:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-07 20:25:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-07 20:25:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-07 20:25:31,978 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-07 20:25:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:31,979 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-07 20:25:31,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:25:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-07 20:25:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:25:31,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:31,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:25:31,983 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-07 20:25:31,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:31,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122870131] [2019-12-07 20:25:31,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:32,040 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 20:25:32,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122870131] [2019-12-07 20:25:32,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:32,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:25:32,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937167123] [2019-12-07 20:25:32,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:25:32,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:25:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:25:32,041 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-07 20:25:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:32,079 INFO L93 Difference]: Finished difference Result 11232 states and 34748 transitions. [2019-12-07 20:25:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:25:32,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 20:25:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:32,100 INFO L225 Difference]: With dead ends: 11232 [2019-12-07 20:25:32,100 INFO L226 Difference]: Without dead ends: 11232 [2019-12-07 20:25:32,101 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 20:25:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11232 states. [2019-12-07 20:25:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11232 to 11152. [2019-12-07 20:25:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11152 states. [2019-12-07 20:25:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11152 states to 11152 states and 34516 transitions. [2019-12-07 20:25:32,324 INFO L78 Accepts]: Start accepts. Automaton has 11152 states and 34516 transitions. Word has length 16 [2019-12-07 20:25:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:32,325 INFO L462 AbstractCegarLoop]: Abstraction has 11152 states and 34516 transitions. [2019-12-07 20:25:32,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:25:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11152 states and 34516 transitions. [2019-12-07 20:25:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:25:32,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:32,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:25:32,327 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1080749242, now seen corresponding path program 1 times [2019-12-07 20:25:32,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:32,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131028415] [2019-12-07 20:25:32,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:32,389 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 20:25:32,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131028415] [2019-12-07 20:25:32,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:32,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:25:32,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221285727] [2019-12-07 20:25:32,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:25:32,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:25:32,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:25:32,390 INFO L87 Difference]: Start difference. First operand 11152 states and 34516 transitions. Second operand 3 states. [2019-12-07 20:25:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:32,441 INFO L93 Difference]: Finished difference Result 19287 states and 59124 transitions. [2019-12-07 20:25:32,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:25:32,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 20:25:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:32,463 INFO L225 Difference]: With dead ends: 19287 [2019-12-07 20:25:32,463 INFO L226 Difference]: Without dead ends: 16859 [2019-12-07 20:25:32,464 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 20:25:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16859 states. [2019-12-07 20:25:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16859 to 16144. [2019-12-07 20:25:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16144 states. [2019-12-07 20:25:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16144 states to 16144 states and 49942 transitions. [2019-12-07 20:25:32,715 INFO L78 Accepts]: Start accepts. Automaton has 16144 states and 49942 transitions. Word has length 16 [2019-12-07 20:25:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:32,715 INFO L462 AbstractCegarLoop]: Abstraction has 16144 states and 49942 transitions. [2019-12-07 20:25:32,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:25:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16144 states and 49942 transitions. [2019-12-07 20:25:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:25:32,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:32,719 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 20:25:32,719 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash -851147492, now seen corresponding path program 1 times [2019-12-07 20:25:32,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:32,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810146603] [2019-12-07 20:25:32,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:32,808 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 20:25:32,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810146603] [2019-12-07 20:25:32,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:32,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:25:32,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604647691] [2019-12-07 20:25:32,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:25:32,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:25:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:25:32,809 INFO L87 Difference]: Start difference. First operand 16144 states and 49942 transitions. Second operand 4 states. [2019-12-07 20:25:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:32,833 INFO L93 Difference]: Finished difference Result 2956 states and 7469 transitions. [2019-12-07 20:25:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:25:32,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 20:25:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:32,838 INFO L225 Difference]: With dead ends: 2956 [2019-12-07 20:25:32,838 INFO L226 Difference]: Without dead ends: 2053 [2019-12-07 20:25:32,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:25:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-07 20:25:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2019-12-07 20:25:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-12-07 20:25:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 4591 transitions. [2019-12-07 20:25:32,861 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 4591 transitions. Word has length 17 [2019-12-07 20:25:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:32,862 INFO L462 AbstractCegarLoop]: Abstraction has 2053 states and 4591 transitions. [2019-12-07 20:25:32,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:25:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 4591 transitions. [2019-12-07 20:25:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:25:32,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:32,863 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] [2019-12-07 20:25:32,863 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:32,864 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 20:25:32,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:32,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172837884] [2019-12-07 20:25:32,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:32,932 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 20:25:32,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172837884] [2019-12-07 20:25:32,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:32,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:25:32,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333377445] [2019-12-07 20:25:32,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:25:32,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:25:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:25:32,933 INFO L87 Difference]: Start difference. First operand 2053 states and 4591 transitions. Second operand 6 states. [2019-12-07 20:25:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:33,256 INFO L93 Difference]: Finished difference Result 5425 states and 11989 transitions. [2019-12-07 20:25:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:25:33,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 20:25:33,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:33,261 INFO L225 Difference]: With dead ends: 5425 [2019-12-07 20:25:33,261 INFO L226 Difference]: Without dead ends: 5390 [2019-12-07 20:25:33,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:25:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2019-12-07 20:25:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 2720. [2019-12-07 20:25:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-12-07 20:25:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 6213 transitions. [2019-12-07 20:25:33,298 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 6213 transitions. Word has length 25 [2019-12-07 20:25:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:33,298 INFO L462 AbstractCegarLoop]: Abstraction has 2720 states and 6213 transitions. [2019-12-07 20:25:33,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:25:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 6213 transitions. [2019-12-07 20:25:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:25:33,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:33,300 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] [2019-12-07 20:25:33,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 20:25:33,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:33,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599575239] [2019-12-07 20:25:33,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:33,366 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 20:25:33,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599575239] [2019-12-07 20:25:33,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:33,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:25:33,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157464426] [2019-12-07 20:25:33,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:25:33,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:25:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:25:33,368 INFO L87 Difference]: Start difference. First operand 2720 states and 6213 transitions. Second operand 6 states. [2019-12-07 20:25:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:33,698 INFO L93 Difference]: Finished difference Result 5057 states and 11057 transitions. [2019-12-07 20:25:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:25:33,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 20:25:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:33,701 INFO L225 Difference]: With dead ends: 5057 [2019-12-07 20:25:33,701 INFO L226 Difference]: Without dead ends: 5028 [2019-12-07 20:25:33,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:25:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2019-12-07 20:25:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 2762. [2019-12-07 20:25:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2019-12-07 20:25:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6322 transitions. [2019-12-07 20:25:33,741 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6322 transitions. Word has length 26 [2019-12-07 20:25:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:33,742 INFO L462 AbstractCegarLoop]: Abstraction has 2762 states and 6322 transitions. [2019-12-07 20:25:33,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:25:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6322 transitions. [2019-12-07 20:25:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:25:33,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:33,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:25:33,744 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-07 20:25:33,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:33,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011798486] [2019-12-07 20:25:33,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:33,792 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 20:25:33,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011798486] [2019-12-07 20:25:33,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:33,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:25:33,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414332313] [2019-12-07 20:25:33,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:25:33,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:25:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:25:33,794 INFO L87 Difference]: Start difference. First operand 2762 states and 6322 transitions. Second operand 5 states. [2019-12-07 20:25:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:33,824 INFO L93 Difference]: Finished difference Result 1446 states and 3288 transitions. [2019-12-07 20:25:33,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:25:33,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 20:25:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:33,826 INFO L225 Difference]: With dead ends: 1446 [2019-12-07 20:25:33,826 INFO L226 Difference]: Without dead ends: 1289 [2019-12-07 20:25:33,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:25:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2019-12-07 20:25:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 829. [2019-12-07 20:25:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 20:25:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1865 transitions. [2019-12-07 20:25:33,836 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1865 transitions. Word has length 28 [2019-12-07 20:25:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:33,837 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1865 transitions. [2019-12-07 20:25:33,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:25:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1865 transitions. [2019-12-07 20:25:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:25:33,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:33,839 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 20:25:33,839 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:33,840 INFO L82 PathProgramCache]: Analyzing trace with hash 680455281, now seen corresponding path program 1 times [2019-12-07 20:25:33,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:33,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472107662] [2019-12-07 20:25:33,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:33,895 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 20:25:33,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472107662] [2019-12-07 20:25:33,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:33,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:25:33,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018506173] [2019-12-07 20:25:33,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:25:33,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:25:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:25:33,897 INFO L87 Difference]: Start difference. First operand 829 states and 1865 transitions. Second operand 3 states. [2019-12-07 20:25:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:33,933 INFO L93 Difference]: Finished difference Result 1053 states and 2338 transitions. [2019-12-07 20:25:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:25:33,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 20:25:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:33,934 INFO L225 Difference]: With dead ends: 1053 [2019-12-07 20:25:33,934 INFO L226 Difference]: Without dead ends: 1053 [2019-12-07 20:25:33,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 20:25:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-07 20:25:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 753. [2019-12-07 20:25:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 20:25:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1676 transitions. [2019-12-07 20:25:33,941 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1676 transitions. Word has length 52 [2019-12-07 20:25:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:33,942 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1676 transitions. [2019-12-07 20:25:33,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:25:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1676 transitions. [2019-12-07 20:25:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:33,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:33,943 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 20:25:33,943 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1343423494, now seen corresponding path program 1 times [2019-12-07 20:25:33,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:33,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997938669] [2019-12-07 20:25:33,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:34,230 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 20:25:34,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997938669] [2019-12-07 20:25:34,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:34,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 20:25:34,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925894343] [2019-12-07 20:25:34,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:25:34,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:25:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:25:34,232 INFO L87 Difference]: Start difference. First operand 753 states and 1676 transitions. Second operand 14 states. [2019-12-07 20:25:34,826 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-07 20:25:35,214 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-07 20:25:36,747 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 20:25:37,110 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-07 20:25:38,828 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 20:25:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:44,143 INFO L93 Difference]: Finished difference Result 7910 states and 16684 transitions. [2019-12-07 20:25:44,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-12-07 20:25:44,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-12-07 20:25:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:44,147 INFO L225 Difference]: With dead ends: 7910 [2019-12-07 20:25:44,147 INFO L226 Difference]: Without dead ends: 5572 [2019-12-07 20:25:44,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8670 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3274, Invalid=17032, Unknown=0, NotChecked=0, Total=20306 [2019-12-07 20:25:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-07 20:25:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 1193. [2019-12-07 20:25:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-07 20:25:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2649 transitions. [2019-12-07 20:25:44,176 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2649 transitions. Word has length 53 [2019-12-07 20:25:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:44,176 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2649 transitions. [2019-12-07 20:25:44,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:25:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2649 transitions. [2019-12-07 20:25:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:44,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:44,178 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 20:25:44,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1900514557, now seen corresponding path program 1 times [2019-12-07 20:25:44,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:44,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437729153] [2019-12-07 20:25:44,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:44,265 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 20:25:44,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437729153] [2019-12-07 20:25:44,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:44,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:25:44,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372017401] [2019-12-07 20:25:44,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:25:44,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:44,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:25:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:25:44,267 INFO L87 Difference]: Start difference. First operand 1193 states and 2649 transitions. Second operand 7 states. [2019-12-07 20:25:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:44,881 INFO L93 Difference]: Finished difference Result 2609 states and 5502 transitions. [2019-12-07 20:25:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:25:44,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 20:25:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:44,883 INFO L225 Difference]: With dead ends: 2609 [2019-12-07 20:25:44,883 INFO L226 Difference]: Without dead ends: 2609 [2019-12-07 20:25:44,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:25:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-12-07 20:25:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1311. [2019-12-07 20:25:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-07 20:25:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 2899 transitions. [2019-12-07 20:25:44,898 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 2899 transitions. Word has length 53 [2019-12-07 20:25:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:44,899 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 2899 transitions. [2019-12-07 20:25:44,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:25:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2899 transitions. [2019-12-07 20:25:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:44,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:44,900 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 20:25:44,900 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash -75320077, now seen corresponding path program 2 times [2019-12-07 20:25:44,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:44,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687801445] [2019-12-07 20:25:44,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:44,955 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 20:25:44,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687801445] [2019-12-07 20:25:44,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:44,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:25:44,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568002628] [2019-12-07 20:25:44,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:25:44,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:25:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:25:44,957 INFO L87 Difference]: Start difference. First operand 1311 states and 2899 transitions. Second operand 4 states. [2019-12-07 20:25:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:44,999 INFO L93 Difference]: Finished difference Result 1300 states and 2863 transitions. [2019-12-07 20:25:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:25:44,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 20:25:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:45,000 INFO L225 Difference]: With dead ends: 1300 [2019-12-07 20:25:45,000 INFO L226 Difference]: Without dead ends: 1300 [2019-12-07 20:25:45,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 20:25:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-07 20:25:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1206. [2019-12-07 20:25:45,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-12-07 20:25:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2648 transitions. [2019-12-07 20:25:45,010 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2648 transitions. Word has length 53 [2019-12-07 20:25:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:45,010 INFO L462 AbstractCegarLoop]: Abstraction has 1206 states and 2648 transitions. [2019-12-07 20:25:45,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:25:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2648 transitions. [2019-12-07 20:25:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:45,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:45,012 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 20:25:45,012 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1716506603, now seen corresponding path program 1 times [2019-12-07 20:25:45,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:45,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571254947] [2019-12-07 20:25:45,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:45,034 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 20:25:45,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571254947] [2019-12-07 20:25:45,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:45,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:25:45,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700741105] [2019-12-07 20:25:45,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:25:45,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:45,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:25:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:25:45,035 INFO L87 Difference]: Start difference. First operand 1206 states and 2648 transitions. Second operand 3 states. [2019-12-07 20:25:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:45,060 INFO L93 Difference]: Finished difference Result 1442 states and 3064 transitions. [2019-12-07 20:25:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:25:45,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 20:25:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:45,061 INFO L225 Difference]: With dead ends: 1442 [2019-12-07 20:25:45,061 INFO L226 Difference]: Without dead ends: 1422 [2019-12-07 20:25:45,062 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 20:25:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2019-12-07 20:25:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1153. [2019-12-07 20:25:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-12-07 20:25:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2507 transitions. [2019-12-07 20:25:45,073 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2507 transitions. Word has length 53 [2019-12-07 20:25:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:45,073 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2507 transitions. [2019-12-07 20:25:45,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:25:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2507 transitions. [2019-12-07 20:25:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:45,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:45,075 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 20:25:45,075 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 718363752, now seen corresponding path program 2 times [2019-12-07 20:25:45,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:45,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90994517] [2019-12-07 20:25:45,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:25:45,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90994517] [2019-12-07 20:25:45,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:45,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:25:45,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939434012] [2019-12-07 20:25:45,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:25:45,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:25:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:25:45,173 INFO L87 Difference]: Start difference. First operand 1153 states and 2507 transitions. Second operand 9 states. [2019-12-07 20:25:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:46,265 INFO L93 Difference]: Finished difference Result 6213 states and 13055 transitions. [2019-12-07 20:25:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 20:25:46,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 20:25:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:46,269 INFO L225 Difference]: With dead ends: 6213 [2019-12-07 20:25:46,269 INFO L226 Difference]: Without dead ends: 5604 [2019-12-07 20:25:46,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 20:25:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2019-12-07 20:25:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 1112. [2019-12-07 20:25:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-12-07 20:25:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2423 transitions. [2019-12-07 20:25:46,292 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 2423 transitions. Word has length 53 [2019-12-07 20:25:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:46,292 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 2423 transitions. [2019-12-07 20:25:46,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:25:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2423 transitions. [2019-12-07 20:25:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:46,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:46,293 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 20:25:46,294 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1575444104, now seen corresponding path program 3 times [2019-12-07 20:25:46,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:46,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139308945] [2019-12-07 20:25:46,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:46,389 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 20:25:46,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139308945] [2019-12-07 20:25:46,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:46,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:25:46,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843922290] [2019-12-07 20:25:46,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:25:46,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:46,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:25:46,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:25:46,390 INFO L87 Difference]: Start difference. First operand 1112 states and 2423 transitions. Second operand 9 states. [2019-12-07 20:25:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:48,038 INFO L93 Difference]: Finished difference Result 7101 states and 14735 transitions. [2019-12-07 20:25:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 20:25:48,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 20:25:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:48,044 INFO L225 Difference]: With dead ends: 7101 [2019-12-07 20:25:48,044 INFO L226 Difference]: Without dead ends: 4787 [2019-12-07 20:25:48,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=421, Invalid=1559, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 20:25:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2019-12-07 20:25:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 1145. [2019-12-07 20:25:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-07 20:25:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2486 transitions. [2019-12-07 20:25:48,077 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2486 transitions. Word has length 53 [2019-12-07 20:25:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:48,078 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2486 transitions. [2019-12-07 20:25:48,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:25:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2486 transitions. [2019-12-07 20:25:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:48,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:48,079 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 20:25:48,079 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash -487878202, now seen corresponding path program 4 times [2019-12-07 20:25:48,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:48,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940482868] [2019-12-07 20:25:48,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:48,117 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 20:25:48,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940482868] [2019-12-07 20:25:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:48,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:25:48,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083331865] [2019-12-07 20:25:48,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:25:48,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:25:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:25:48,118 INFO L87 Difference]: Start difference. First operand 1145 states and 2486 transitions. Second operand 3 states. [2019-12-07 20:25:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:48,128 INFO L93 Difference]: Finished difference Result 2023 states and 4362 transitions. [2019-12-07 20:25:48,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:25:48,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 20:25:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:48,129 INFO L225 Difference]: With dead ends: 2023 [2019-12-07 20:25:48,129 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 20:25:48,129 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 20:25:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 20:25:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2019-12-07 20:25:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-07 20:25:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 2006 transitions. [2019-12-07 20:25:48,140 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 2006 transitions. Word has length 53 [2019-12-07 20:25:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:48,140 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 2006 transitions. [2019-12-07 20:25:48,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:25:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 2006 transitions. [2019-12-07 20:25:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:48,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:48,142 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 20:25:48,142 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 5 times [2019-12-07 20:25:48,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:48,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294969069] [2019-12-07 20:25:48,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:48,320 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 20:25:48,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294969069] [2019-12-07 20:25:48,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:48,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 20:25:48,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007061129] [2019-12-07 20:25:48,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:25:48,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:25:48,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:25:48,322 INFO L87 Difference]: Start difference. First operand 947 states and 2006 transitions. Second operand 12 states. [2019-12-07 20:25:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:49,327 INFO L93 Difference]: Finished difference Result 1398 states and 2892 transitions. [2019-12-07 20:25:49,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:25:49,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 20:25:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:49,328 INFO L225 Difference]: With dead ends: 1398 [2019-12-07 20:25:49,328 INFO L226 Difference]: Without dead ends: 954 [2019-12-07 20:25:49,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-12-07 20:25:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-12-07 20:25:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 948. [2019-12-07 20:25:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-07 20:25:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2007 transitions. [2019-12-07 20:25:49,335 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2007 transitions. Word has length 53 [2019-12-07 20:25:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:49,335 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 2007 transitions. [2019-12-07 20:25:49,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:25:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2007 transitions. [2019-12-07 20:25:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:49,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:49,337 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 20:25:49,337 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:49,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1101315546, now seen corresponding path program 6 times [2019-12-07 20:25:49,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:49,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493645586] [2019-12-07 20:25:49,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:49,542 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 20:25:49,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493645586] [2019-12-07 20:25:49,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:49,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 20:25:49,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207333501] [2019-12-07 20:25:49,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:25:49,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:49,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:25:49,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:25:49,543 INFO L87 Difference]: Start difference. First operand 948 states and 2007 transitions. Second operand 13 states. [2019-12-07 20:25:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:50,284 INFO L93 Difference]: Finished difference Result 1145 states and 2364 transitions. [2019-12-07 20:25:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 20:25:50,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-07 20:25:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:50,286 INFO L225 Difference]: With dead ends: 1145 [2019-12-07 20:25:50,286 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 20:25:50,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-07 20:25:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 20:25:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2019-12-07 20:25:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 20:25:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1957 transitions. [2019-12-07 20:25:50,306 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1957 transitions. Word has length 53 [2019-12-07 20:25:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:50,306 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1957 transitions. [2019-12-07 20:25:50,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:25:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1957 transitions. [2019-12-07 20:25:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:50,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:50,309 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 20:25:50,309 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1821077354, now seen corresponding path program 7 times [2019-12-07 20:25:50,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:50,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969864469] [2019-12-07 20:25:50,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:25:50,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969864469] [2019-12-07 20:25:50,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:50,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 20:25:50,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478586722] [2019-12-07 20:25:50,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 20:25:50,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 20:25:50,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:25:50,663 INFO L87 Difference]: Start difference. First operand 923 states and 1957 transitions. Second operand 16 states. [2019-12-07 20:25:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:52,378 INFO L93 Difference]: Finished difference Result 1279 states and 2630 transitions. [2019-12-07 20:25:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 20:25:52,378 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-12-07 20:25:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:52,379 INFO L225 Difference]: With dead ends: 1279 [2019-12-07 20:25:52,379 INFO L226 Difference]: Without dead ends: 1095 [2019-12-07 20:25:52,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 20:25:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-12-07 20:25:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 826. [2019-12-07 20:25:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-07 20:25:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1727 transitions. [2019-12-07 20:25:52,387 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1727 transitions. Word has length 53 [2019-12-07 20:25:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:52,387 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1727 transitions. [2019-12-07 20:25:52,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 20:25:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1727 transitions. [2019-12-07 20:25:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:52,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:52,389 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 20:25:52,389 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:52,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1750747258, now seen corresponding path program 8 times [2019-12-07 20:25:52,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:52,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100850404] [2019-12-07 20:25:52,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:25:52,449 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 20:25:52,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100850404] [2019-12-07 20:25:52,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:25:52,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:25:52,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293008490] [2019-12-07 20:25:52,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:25:52,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:25:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:25:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:25:52,451 INFO L87 Difference]: Start difference. First operand 826 states and 1727 transitions. Second operand 7 states. [2019-12-07 20:25:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:25:52,571 INFO L93 Difference]: Finished difference Result 1368 states and 2788 transitions. [2019-12-07 20:25:52,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:25:52,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 20:25:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:25:52,572 INFO L225 Difference]: With dead ends: 1368 [2019-12-07 20:25:52,572 INFO L226 Difference]: Without dead ends: 930 [2019-12-07 20:25:52,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:25:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-12-07 20:25:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 797. [2019-12-07 20:25:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 20:25:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1673 transitions. [2019-12-07 20:25:52,578 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1673 transitions. Word has length 53 [2019-12-07 20:25:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:25:52,578 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1673 transitions. [2019-12-07 20:25:52,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:25:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1673 transitions. [2019-12-07 20:25:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 20:25:52,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:25:52,580 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 20:25:52,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:25:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:25:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 9 times [2019-12-07 20:25:52,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:25:52,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085068386] [2019-12-07 20:25:52,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:25:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:25:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:25:52,650 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:25:52,651 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:25:52,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:25:52,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 20:25:52,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 20:25:52,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In408465644 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In408465644 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out408465644|)) (and (= ~y$w_buff0_used~0_In408465644 |P0Thread1of1ForFork0_#t~ite5_Out408465644|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In408465644} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out408465644|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In408465644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:25:52,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In35245333 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In35245333 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In35245333 256))) (and (= 0 (mod ~y$w_buff1_used~0_In35245333 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In35245333 256)))) (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| ~y$w_buff0~0_In35245333) (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| |P1Thread1of1ForFork1_#t~ite15_Out35245333|)) (and (not .cse0) (= ~y$w_buff0~0_In35245333 |P1Thread1of1ForFork1_#t~ite15_Out35245333|) (= |P1Thread1of1ForFork1_#t~ite14_In35245333| |P1Thread1of1ForFork1_#t~ite14_Out35245333|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In35245333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$w_buff0~0=~y$w_buff0~0_In35245333, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In35245333, ~weak$$choice2~0=~weak$$choice2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In35245333|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35245333} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In35245333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$w_buff0~0=~y$w_buff0~0_In35245333, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out35245333|, ~weak$$choice2~0=~weak$$choice2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out35245333|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35245333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 20:25:52,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-596423444 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-596423444| ~y$w_buff1~0_In-596423444) (= |P1Thread1of1ForFork1_#t~ite17_In-596423444| |P1Thread1of1ForFork1_#t~ite17_Out-596423444|) (not .cse0)) (and (= ~y$w_buff1~0_In-596423444 |P1Thread1of1ForFork1_#t~ite17_Out-596423444|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-596423444 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-596423444 256))) (= 0 (mod ~y$w_buff0_used~0_In-596423444 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-596423444 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite18_Out-596423444| |P1Thread1of1ForFork1_#t~ite17_Out-596423444|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596423444, ~y$w_buff1~0=~y$w_buff1~0_In-596423444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-596423444|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596423444, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-596423444|, ~y$w_buff1~0=~y$w_buff1~0_In-596423444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-596423444|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 20:25:52,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In694509339 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In694509339 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In694509339 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In694509339 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out694509339|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In694509339 |P0Thread1of1ForFork0_#t~ite6_Out694509339|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In694509339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out694509339|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In694509339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:25:52,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out-1531277962 ~y$r_buff0_thd1~0_In-1531277962)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1531277962 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1531277962 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~y$r_buff0_thd1~0_Out-1531277962 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1531277962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1531277962|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1531277962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:25:52,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-99152115 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-99152115 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-99152115 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-99152115 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-99152115| ~y$r_buff1_thd1~0_In-99152115)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-99152115| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-99152115, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-99152115, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-99152115, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-99152115, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-99152115|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:25:52,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In131135957 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In131135957| |P1Thread1of1ForFork1_#t~ite20_Out131135957|) (not .cse0) (= ~y$w_buff0_used~0_In131135957 |P1Thread1of1ForFork1_#t~ite21_Out131135957|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out131135957| |P1Thread1of1ForFork1_#t~ite21_Out131135957|) (= |P1Thread1of1ForFork1_#t~ite20_Out131135957| ~y$w_buff0_used~0_In131135957) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In131135957 256)))) (or (= (mod ~y$w_buff0_used~0_In131135957 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In131135957 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In131135957 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In131135957|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131135957, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out131135957|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131135957, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out131135957|, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:25:52,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 20:25:52,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1001931267 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| ~y$r_buff1_thd2~0_In-1001931267) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1001931267 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1001931267 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1001931267 256)) (and (= (mod ~y$w_buff1_used~0_In-1001931267 256) 0) .cse1)))) (and (not .cse0) (= ~y$r_buff1_thd2~0_In-1001931267 |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) (= |P1Thread1of1ForFork1_#t~ite29_In-1001931267| |P1Thread1of1ForFork1_#t~ite29_Out-1001931267|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1001931267, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1001931267|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001931267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1001931267} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1001931267, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1001931267|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1001931267|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001931267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1001931267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 20:25:52,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 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_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 20:25:52,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 20:25:52,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1862196979 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1862196979 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|)) (and (= ~y~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1862196979, ~y$w_buff1~0=~y$w_buff1~0_In-1862196979, ~y~0=~y~0_In-1862196979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1862196979} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1862196979, ~y$w_buff1~0=~y$w_buff1~0_In-1862196979, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1862196979|, ~y~0=~y~0_In-1862196979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1862196979} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 20:25:52,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 20:25:52,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1705681559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1705681559 256)))) (or (and (= ~y$w_buff0_used~0_In-1705681559 |P1Thread1of1ForFork1_#t~ite34_Out-1705681559|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1705681559| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1705681559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1705681559, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1705681559|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 20:25:52,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In729116322 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In729116322 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In729116322 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In729116322 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out729116322|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out729116322| ~y$w_buff1_used~0_In729116322) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In729116322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In729116322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In729116322} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In729116322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In729116322, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out729116322|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In729116322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-586579556 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-586579556 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|)) (and (= ~y$r_buff0_thd2~0_In-586579556 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-586579556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586579556} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-586579556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586579556, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-586579556|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2112925162 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2112925162 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2112925162 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-2112925162 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| ~y$r_buff1_thd2~0_In-2112925162) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2112925162|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1915285819 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1915285819 256) 0))) (or (and (= ~y~0_In1915285819 |ULTIMATE.start_main_#t~ite40_Out1915285819|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1915285819| ~y$w_buff1~0_In1915285819) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1915285819, ~y~0=~y~0_In1915285819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915285819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1915285819|, ~y$w_buff1~0=~y$w_buff1~0_In1915285819, ~y~0=~y~0_In1915285819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915285819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 20:25:52,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-628483083 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-628483083 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-628483083|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-628483083 |ULTIMATE.start_main_#t~ite42_Out-628483083|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-628483083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-628483083} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-628483083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-628483083, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-628483083|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:25:52,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1527813265 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1527813265 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1527813265 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1527813265 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1527813265| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out1527813265| ~y$w_buff1_used~0_In1527813265)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1527813265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527813265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527813265} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1527813265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1527813265|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527813265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527813265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 20:25:52,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1931109068 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1931109068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1931109068| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1931109068| ~y$r_buff0_thd0~0_In1931109068)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1931109068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1931109068, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1931109068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:25:52,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1060743024 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1060743024 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1060743024 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1060743024 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1060743024| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1060743024| ~y$r_buff1_thd0~0_In1060743024) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1060743024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1060743024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1060743024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1060743024} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1060743024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1060743024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1060743024, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1060743024|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1060743024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 20:25:52,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:25:52,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:25:52 BasicIcfg [2019-12-07 20:25:52,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:25:52,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:25:52,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:25:52,711 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:25:52,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:25:26" (3/4) ... [2019-12-07 20:25:52,713 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:25:52,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 20:25:52,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 20:25:52,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 20:25:52,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In408465644 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In408465644 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out408465644|)) (and (= ~y$w_buff0_used~0_In408465644 |P0Thread1of1ForFork0_#t~ite5_Out408465644|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In408465644} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out408465644|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In408465644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 20:25:52,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In35245333 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In35245333 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In35245333 256))) (and (= 0 (mod ~y$w_buff1_used~0_In35245333 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In35245333 256)))) (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| ~y$w_buff0~0_In35245333) (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| |P1Thread1of1ForFork1_#t~ite15_Out35245333|)) (and (not .cse0) (= ~y$w_buff0~0_In35245333 |P1Thread1of1ForFork1_#t~ite15_Out35245333|) (= |P1Thread1of1ForFork1_#t~ite14_In35245333| |P1Thread1of1ForFork1_#t~ite14_Out35245333|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In35245333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$w_buff0~0=~y$w_buff0~0_In35245333, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In35245333, ~weak$$choice2~0=~weak$$choice2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In35245333|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35245333} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In35245333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$w_buff0~0=~y$w_buff0~0_In35245333, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out35245333|, ~weak$$choice2~0=~weak$$choice2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out35245333|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In35245333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 20:25:52,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-596423444 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-596423444| ~y$w_buff1~0_In-596423444) (= |P1Thread1of1ForFork1_#t~ite17_In-596423444| |P1Thread1of1ForFork1_#t~ite17_Out-596423444|) (not .cse0)) (and (= ~y$w_buff1~0_In-596423444 |P1Thread1of1ForFork1_#t~ite17_Out-596423444|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-596423444 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-596423444 256))) (= 0 (mod ~y$w_buff0_used~0_In-596423444 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-596423444 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite18_Out-596423444| |P1Thread1of1ForFork1_#t~ite17_Out-596423444|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596423444, ~y$w_buff1~0=~y$w_buff1~0_In-596423444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-596423444|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596423444, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-596423444|, ~y$w_buff1~0=~y$w_buff1~0_In-596423444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-596423444|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 20:25:52,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In694509339 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In694509339 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In694509339 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In694509339 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out694509339|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In694509339 |P0Thread1of1ForFork0_#t~ite6_Out694509339|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In694509339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out694509339|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In694509339, ~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 20:25:52,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out-1531277962 ~y$r_buff0_thd1~0_In-1531277962)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1531277962 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1531277962 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~y$r_buff0_thd1~0_Out-1531277962 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1531277962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531277962, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1531277962|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1531277962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:25:52,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-99152115 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-99152115 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-99152115 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-99152115 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-99152115| ~y$r_buff1_thd1~0_In-99152115)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-99152115| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-99152115, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-99152115, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-99152115, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-99152115, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-99152115|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 20:25:52,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In131135957 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In131135957| |P1Thread1of1ForFork1_#t~ite20_Out131135957|) (not .cse0) (= ~y$w_buff0_used~0_In131135957 |P1Thread1of1ForFork1_#t~ite21_Out131135957|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out131135957| |P1Thread1of1ForFork1_#t~ite21_Out131135957|) (= |P1Thread1of1ForFork1_#t~ite20_Out131135957| ~y$w_buff0_used~0_In131135957) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In131135957 256)))) (or (= (mod ~y$w_buff0_used~0_In131135957 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In131135957 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In131135957 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In131135957|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131135957, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out131135957|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In131135957, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out131135957|, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 20:25:52,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 20:25:52,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1001931267 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| ~y$r_buff1_thd2~0_In-1001931267) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1001931267 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1001931267 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1001931267 256)) (and (= (mod ~y$w_buff1_used~0_In-1001931267 256) 0) .cse1)))) (and (not .cse0) (= ~y$r_buff1_thd2~0_In-1001931267 |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) (= |P1Thread1of1ForFork1_#t~ite29_In-1001931267| |P1Thread1of1ForFork1_#t~ite29_Out-1001931267|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1001931267, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1001931267|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001931267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1001931267} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1001931267, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1001931267|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1001931267|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001931267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1001931267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 20:25:52,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 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_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 20:25:52,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 20:25:52,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1862196979 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1862196979 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|)) (and (= ~y~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1862196979, ~y$w_buff1~0=~y$w_buff1~0_In-1862196979, ~y~0=~y~0_In-1862196979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1862196979} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1862196979, ~y$w_buff1~0=~y$w_buff1~0_In-1862196979, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1862196979|, ~y~0=~y~0_In-1862196979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1862196979} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 20:25:52,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 20:25:52,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1705681559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1705681559 256)))) (or (and (= ~y$w_buff0_used~0_In-1705681559 |P1Thread1of1ForFork1_#t~ite34_Out-1705681559|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1705681559| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1705681559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1705681559, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1705681559|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 20:25:52,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In729116322 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In729116322 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In729116322 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In729116322 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out729116322|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out729116322| ~y$w_buff1_used~0_In729116322) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In729116322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In729116322, ~y$w_buff1_used~0=~y$w_buff1_used~0_In729116322} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In729116322, ~y$w_buff0_used~0=~y$w_buff0_used~0_In729116322, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In729116322, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out729116322|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In729116322} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-586579556 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-586579556 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|)) (and (= ~y$r_buff0_thd2~0_In-586579556 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-586579556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586579556} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-586579556, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586579556, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-586579556|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2112925162 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2112925162 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2112925162 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-2112925162 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| ~y$r_buff1_thd2~0_In-2112925162) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2112925162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2112925162, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2112925162|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2112925162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1915285819 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1915285819 256) 0))) (or (and (= ~y~0_In1915285819 |ULTIMATE.start_main_#t~ite40_Out1915285819|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1915285819| ~y$w_buff1~0_In1915285819) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1915285819, ~y~0=~y~0_In1915285819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915285819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1915285819|, ~y$w_buff1~0=~y$w_buff1~0_In1915285819, ~y~0=~y~0_In1915285819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1915285819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1915285819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 20:25:52,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-628483083 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-628483083 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-628483083|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-628483083 |ULTIMATE.start_main_#t~ite42_Out-628483083|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-628483083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-628483083} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-628483083, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-628483083, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-628483083|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 20:25:52,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1527813265 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1527813265 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1527813265 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1527813265 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1527813265| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out1527813265| ~y$w_buff1_used~0_In1527813265)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1527813265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527813265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527813265} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1527813265, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1527813265, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1527813265|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1527813265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1527813265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 20:25:52,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1931109068 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1931109068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1931109068| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1931109068| ~y$r_buff0_thd0~0_In1931109068)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1931109068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1931109068, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1931109068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 20:25:52,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1060743024 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1060743024 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1060743024 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1060743024 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1060743024| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1060743024| ~y$r_buff1_thd0~0_In1060743024) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1060743024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1060743024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1060743024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1060743024} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1060743024, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1060743024, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1060743024, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1060743024|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1060743024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 20:25:52,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:25:52,764 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2fc83929-db95-4f5b-b835-ee73b9c49c09/bin/utaipan/witness.graphml [2019-12-07 20:25:52,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:25:52,765 INFO L168 Benchmark]: Toolchain (without parser) took 26872.20 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 752.4 MB). Free memory was 934.4 MB in the beginning and 1.3 GB in the end (delta: -359.9 MB). Peak memory consumption was 392.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:25:52,765 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:25:52,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:25:52,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.52 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 20:25:52,766 INFO L168 Benchmark]: Boogie Preprocessor took 27.85 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 20:25:52,766 INFO L168 Benchmark]: RCFGBuilder took 400.38 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:25:52,766 INFO L168 Benchmark]: TraceAbstraction took 25962.93 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 653.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -304.0 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:25:52,766 INFO L168 Benchmark]: Witness Printer took 53.29 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:25:52,768 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.52 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 27.85 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 400.38 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25962.93 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 653.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -304.0 MB). Peak memory consumption was 349.2 MB. Max. memory is 11.5 GB. * Witness Printer took 53.29 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3273 SDtfs, 6937 SDslu, 10246 SDs, 0 SdLazy, 9582 SolverSat, 930 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 35 SyntacticMatches, 17 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10510 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16144occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 23845 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 844 NumberOfCodeBlocks, 844 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 245922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...