./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/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 2894ac2f07d93de98abd209517006f1f24ae90d3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:56:52,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:56:52,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:56:52,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:56:52,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:56:52,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:56:52,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:56:52,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:56:52,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:56:52,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:56:52,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:56:52,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:56:52,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:56:52,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:56:52,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:56:52,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:56:52,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:56:52,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:56:52,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:56:52,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:56:52,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:56:52,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:56:52,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:56:52,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:56:52,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:56:52,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:56:52,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:56:52,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:56:52,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:56:52,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:56:52,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:56:52,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:56:52,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:56:52,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:56:52,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:56:52,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:56:52,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:56:52,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:56:52,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:56:52,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:56:52,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:56:52,103 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:56:52,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:56:52,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:56:52,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:56:52,114 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:56:52,114 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:56:52,114 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:56:52,114 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:56:52,114 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:56:52,114 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:56:52,115 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:56:52,115 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:56:52,115 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:56:52,115 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:56:52,115 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:56:52,115 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:56:52,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:56:52,116 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:56:52,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:56:52,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:56:52,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:56:52,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:56:52,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:56:52,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:56:52,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:56:52,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:56:52,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:56:52,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:56:52,119 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_8aef1a66-a858-4209-b7b6-e0021a94c9f3/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 -> 2894ac2f07d93de98abd209517006f1f24ae90d3 [2019-12-07 21:56:52,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:56:52,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:56:52,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:56:52,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:56:52,233 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:56:52,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2019-12-07 21:56:52,274 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/data/cf6ebacc0/22fb2fbdb5bf4e7a99146201efb40828/FLAGebbdd389b [2019-12-07 21:56:52,750 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:56:52,751 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2019-12-07 21:56:52,761 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/data/cf6ebacc0/22fb2fbdb5bf4e7a99146201efb40828/FLAGebbdd389b [2019-12-07 21:56:52,770 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/data/cf6ebacc0/22fb2fbdb5bf4e7a99146201efb40828 [2019-12-07 21:56:52,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:56:52,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:56:52,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:56:52,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:56:52,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:56:52,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:56:52" (1/1) ... [2019-12-07 21:56:52,778 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 09:56:52, skipping insertion in model container [2019-12-07 21:56:52,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:56:52" (1/1) ... [2019-12-07 21:56:52,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:56:52,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:56:53,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:56:53,072 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:56:53,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:56:53,160 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:56:53,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53 WrapperNode [2019-12-07 21:56:53,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:56:53,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:56:53,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:56:53,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:56:53,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:56:53,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:56:53,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:56:53,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:56:53,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... [2019-12-07 21:56:53,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:56:53,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:56:53,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:56:53,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:56:53,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/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 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:56:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:56:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:56:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:56:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:56:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:56:53,272 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 21:56:53,594 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:56:53,594 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:56:53,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:56:53 BoogieIcfgContainer [2019-12-07 21:56:53,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:56:53,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:56:53,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:56:53,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:56:53,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:56:52" (1/3) ... [2019-12-07 21:56:53,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538ed0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:56:53, skipping insertion in model container [2019-12-07 21:56:53,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:53" (2/3) ... [2019-12-07 21:56:53,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538ed0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:56:53, skipping insertion in model container [2019-12-07 21:56:53,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:56:53" (3/3) ... [2019-12-07 21:56:53,600 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-12-07 21:56:53,606 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:56:53,606 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:56:53,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:56:53,611 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:56:53,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:53,651 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 21:56:53,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:56:53,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:56:53,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:56:53,663 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:56:53,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:56:53,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:56:53,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:56:53,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:56:53,674 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-07 21:56:53,675 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-07 21:56:53,721 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-07 21:56:53,722 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:56:53,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 462 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 21:56:53,741 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-07 21:56:53,763 INFO L134 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-07 21:56:53,763 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:56:53,767 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 462 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 21:56:53,775 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-07 21:56:53,776 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:56:56,233 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-07 21:56:56,305 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-07 21:56:56,305 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-07 21:56:56,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-07 21:56:56,625 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-07 21:56:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-07 21:56:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:56:56,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:56,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:56:56,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:56,635 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-07 21:56:56,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:56,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927958587] [2019-12-07 21:56:56,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:56,786 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 21:56:56,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927958587] [2019-12-07 21:56:56,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:56,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:56:56,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509417188] [2019-12-07 21:56:56,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:56:56,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:56:56,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:56:56,802 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-07 21:56:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:57,014 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-07 21:56:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:57,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:56:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:57,088 INFO L225 Difference]: With dead ends: 8560 [2019-12-07 21:56:57,088 INFO L226 Difference]: Without dead ends: 8391 [2019-12-07 21:56:57,089 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 21:56:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-07 21:56:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-07 21:56:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-07 21:56:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-07 21:56:57,358 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-07 21:56:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:57,358 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-07 21:56:57,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:56:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-07 21:56:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:56:57,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:57,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:57,361 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-07 21:56:57,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:57,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737172102] [2019-12-07 21:56:57,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:57,431 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 21:56:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737172102] [2019-12-07 21:56:57,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:57,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:56:57,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422743105] [2019-12-07 21:56:57,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:56:57,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:56:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:57,433 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-07 21:56:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:57,675 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-07 21:56:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:56:57,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:56:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:57,730 INFO L225 Difference]: With dead ends: 13399 [2019-12-07 21:56:57,731 INFO L226 Difference]: Without dead ends: 13392 [2019-12-07 21:56:57,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-07 21:56:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-07 21:56:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-07 21:56:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-07 21:56:58,051 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-07 21:56:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:58,051 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-07 21:56:58,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:56:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-07 21:56:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:56:58,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:58,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:58,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:58,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:58,054 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-07 21:56:58,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:58,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611854668] [2019-12-07 21:56:58,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:58,105 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 21:56:58,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611854668] [2019-12-07 21:56:58,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:58,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:56:58,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951525303] [2019-12-07 21:56:58,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:56:58,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:58,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:56:58,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:58,106 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-07 21:56:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:58,132 INFO L93 Difference]: Finished difference Result 1949 states and 4516 transitions. [2019-12-07 21:56:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:56:58,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:56:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:58,136 INFO L225 Difference]: With dead ends: 1949 [2019-12-07 21:56:58,137 INFO L226 Difference]: Without dead ends: 1663 [2019-12-07 21:56:58,137 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 21:56:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-12-07 21:56:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2019-12-07 21:56:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-12-07 21:56:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3725 transitions. [2019-12-07 21:56:58,171 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3725 transitions. Word has length 11 [2019-12-07 21:56:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:58,171 INFO L462 AbstractCegarLoop]: Abstraction has 1663 states and 3725 transitions. [2019-12-07 21:56:58,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:56:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3725 transitions. [2019-12-07 21:56:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:56:58,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:58,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:58,174 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1402369775, now seen corresponding path program 1 times [2019-12-07 21:56:58,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:58,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510272619] [2019-12-07 21:56:58,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:58,237 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 21:56:58,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510272619] [2019-12-07 21:56:58,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:58,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:56:58,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927944804] [2019-12-07 21:56:58,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:56:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:56:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:58,239 INFO L87 Difference]: Start difference. First operand 1663 states and 3725 transitions. Second operand 5 states. [2019-12-07 21:56:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:58,279 INFO L93 Difference]: Finished difference Result 403 states and 750 transitions. [2019-12-07 21:56:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:56:58,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 21:56:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:58,280 INFO L225 Difference]: With dead ends: 403 [2019-12-07 21:56:58,280 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 21:56:58,281 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 21:56:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 21:56:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-07 21:56:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-07 21:56:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 595 transitions. [2019-12-07 21:56:58,287 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 595 transitions. Word has length 23 [2019-12-07 21:56:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:58,287 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 595 transitions. [2019-12-07 21:56:58,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:56:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 595 transitions. [2019-12-07 21:56:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 21:56:58,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:58,289 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 21:56:58,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1079059862, now seen corresponding path program 1 times [2019-12-07 21:56:58,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:58,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214326121] [2019-12-07 21:56:58,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:58,352 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 21:56:58,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214326121] [2019-12-07 21:56:58,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:58,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:56:58,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967206928] [2019-12-07 21:56:58,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:56:58,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:56:58,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:56:58,353 INFO L87 Difference]: Start difference. First operand 322 states and 595 transitions. Second operand 3 states. [2019-12-07 21:56:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:58,387 INFO L93 Difference]: Finished difference Result 332 states and 605 transitions. [2019-12-07 21:56:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:58,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 21:56:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:58,388 INFO L225 Difference]: With dead ends: 332 [2019-12-07 21:56:58,388 INFO L226 Difference]: Without dead ends: 332 [2019-12-07 21:56:58,388 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 21:56:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-07 21:56:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-07 21:56:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-07 21:56:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 601 transitions. [2019-12-07 21:56:58,393 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 601 transitions. Word has length 52 [2019-12-07 21:56:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:58,393 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 601 transitions. [2019-12-07 21:56:58,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:56:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 601 transitions. [2019-12-07 21:56:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 21:56:58,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:58,395 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 21:56:58,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-07 21:56:58,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:58,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692392657] [2019-12-07 21:56:58,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:58,474 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 21:56:58,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692392657] [2019-12-07 21:56:58,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:58,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:56:58,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891651488] [2019-12-07 21:56:58,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:56:58,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:56:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:58,475 INFO L87 Difference]: Start difference. First operand 328 states and 601 transitions. Second operand 5 states. [2019-12-07 21:56:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:58,612 INFO L93 Difference]: Finished difference Result 459 states and 837 transitions. [2019-12-07 21:56:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:56:58,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 21:56:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:58,613 INFO L225 Difference]: With dead ends: 459 [2019-12-07 21:56:58,613 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 21:56:58,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 21:56:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-07 21:56:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-07 21:56:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 692 transitions. [2019-12-07 21:56:58,618 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 692 transitions. Word has length 52 [2019-12-07 21:56:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:58,618 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 692 transitions. [2019-12-07 21:56:58,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:56:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 692 transitions. [2019-12-07 21:56:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 21:56:58,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:58,620 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 21:56:58,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-07 21:56:58,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:58,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174547209] [2019-12-07 21:56:58,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:58,691 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 21:56:58,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174547209] [2019-12-07 21:56:58,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:58,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:56:58,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173817919] [2019-12-07 21:56:58,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:56:58,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:58,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:56:58,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:58,692 INFO L87 Difference]: Start difference. First operand 375 states and 692 transitions. Second operand 6 states. [2019-12-07 21:56:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:58,894 INFO L93 Difference]: Finished difference Result 644 states and 1177 transitions. [2019-12-07 21:56:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:56:58,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 21:56:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:58,896 INFO L225 Difference]: With dead ends: 644 [2019-12-07 21:56:58,896 INFO L226 Difference]: Without dead ends: 644 [2019-12-07 21:56:58,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:56:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-07 21:56:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 405. [2019-12-07 21:56:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 21:56:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 752 transitions. [2019-12-07 21:56:58,905 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 752 transitions. Word has length 52 [2019-12-07 21:56:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:58,905 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 752 transitions. [2019-12-07 21:56:58,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:56:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 752 transitions. [2019-12-07 21:56:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 21:56:58,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:58,906 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 21:56:58,906 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-07 21:56:58,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:58,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623518813] [2019-12-07 21:56:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:58,986 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 21:56:58,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623518813] [2019-12-07 21:56:58,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:58,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:56:58,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964857421] [2019-12-07 21:56:58,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:56:58,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:58,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:56:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:58,987 INFO L87 Difference]: Start difference. First operand 405 states and 752 transitions. Second operand 6 states. [2019-12-07 21:56:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:59,167 INFO L93 Difference]: Finished difference Result 622 states and 1139 transitions. [2019-12-07 21:56:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:56:59,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 21:56:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:59,169 INFO L225 Difference]: With dead ends: 622 [2019-12-07 21:56:59,169 INFO L226 Difference]: Without dead ends: 622 [2019-12-07 21:56:59,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:56:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-07 21:56:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 446. [2019-12-07 21:56:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-07 21:56:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 830 transitions. [2019-12-07 21:56:59,175 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 830 transitions. Word has length 52 [2019-12-07 21:56:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:59,175 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 830 transitions. [2019-12-07 21:56:59,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:56:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 830 transitions. [2019-12-07 21:56:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 21:56:59,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:59,176 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 21:56:59,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1537444781, now seen corresponding path program 4 times [2019-12-07 21:56:59,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:59,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109232978] [2019-12-07 21:56:59,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:59,240 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 21:56:59,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109232978] [2019-12-07 21:56:59,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:59,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:56:59,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985090934] [2019-12-07 21:56:59,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:56:59,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:56:59,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:56:59,241 INFO L87 Difference]: Start difference. First operand 446 states and 830 transitions. Second operand 7 states. [2019-12-07 21:56:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:59,508 INFO L93 Difference]: Finished difference Result 704 states and 1288 transitions. [2019-12-07 21:56:59,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:56:59,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 21:56:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:59,509 INFO L225 Difference]: With dead ends: 704 [2019-12-07 21:56:59,509 INFO L226 Difference]: Without dead ends: 704 [2019-12-07 21:56:59,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:56:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-07 21:56:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 425. [2019-12-07 21:56:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-07 21:56:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 789 transitions. [2019-12-07 21:56:59,520 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 789 transitions. Word has length 52 [2019-12-07 21:56:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:59,520 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 789 transitions. [2019-12-07 21:56:59,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:56:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 789 transitions. [2019-12-07 21:56:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 21:56:59,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:59,522 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 21:56:59,522 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1548250017, now seen corresponding path program 1 times [2019-12-07 21:56:59,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:59,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831846845] [2019-12-07 21:56:59,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:59,591 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 21:56:59,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831846845] [2019-12-07 21:56:59,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:59,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:56:59,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740050267] [2019-12-07 21:56:59,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:56:59,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:56:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:56:59,593 INFO L87 Difference]: Start difference. First operand 425 states and 789 transitions. Second operand 3 states. [2019-12-07 21:56:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:59,621 INFO L93 Difference]: Finished difference Result 424 states and 787 transitions. [2019-12-07 21:56:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:59,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 21:56:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:59,623 INFO L225 Difference]: With dead ends: 424 [2019-12-07 21:56:59,623 INFO L226 Difference]: Without dead ends: 424 [2019-12-07 21:56:59,623 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 21:56:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-07 21:56:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 293. [2019-12-07 21:56:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-12-07 21:56:59,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 547 transitions. [2019-12-07 21:56:59,628 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 547 transitions. Word has length 53 [2019-12-07 21:56:59,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:59,629 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 547 transitions. [2019-12-07 21:56:59,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:56:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 547 transitions. [2019-12-07 21:56:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 21:56:59,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:59,630 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 21:56:59,630 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash 768058421, now seen corresponding path program 1 times [2019-12-07 21:56:59,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:59,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945322953] [2019-12-07 21:56:59,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:59,670 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 21:56:59,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945322953] [2019-12-07 21:56:59,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:59,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:56:59,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365575813] [2019-12-07 21:56:59,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:56:59,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:56:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:56:59,671 INFO L87 Difference]: Start difference. First operand 293 states and 547 transitions. Second operand 3 states. [2019-12-07 21:56:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:59,680 INFO L93 Difference]: Finished difference Result 289 states and 522 transitions. [2019-12-07 21:56:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:59,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 21:56:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:59,681 INFO L225 Difference]: With dead ends: 289 [2019-12-07 21:56:59,681 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 21:56:59,681 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 21:56:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 21:56:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 273. [2019-12-07 21:56:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-07 21:56:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 492 transitions. [2019-12-07 21:56:59,684 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 492 transitions. Word has length 53 [2019-12-07 21:56:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:59,685 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 492 transitions. [2019-12-07 21:56:59,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:56:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 492 transitions. [2019-12-07 21:56:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 21:56:59,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:59,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:59,685 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-07 21:56:59,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:59,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370058862] [2019-12-07 21:56:59,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:59,758 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 21:56:59,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370058862] [2019-12-07 21:56:59,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:59,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:56:59,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147343092] [2019-12-07 21:56:59,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:56:59,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:59,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:56:59,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:59,759 INFO L87 Difference]: Start difference. First operand 273 states and 492 transitions. Second operand 6 states. [2019-12-07 21:56:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:59,803 INFO L93 Difference]: Finished difference Result 487 states and 871 transitions. [2019-12-07 21:56:59,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:56:59,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-07 21:56:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:59,803 INFO L225 Difference]: With dead ends: 487 [2019-12-07 21:56:59,803 INFO L226 Difference]: Without dead ends: 233 [2019-12-07 21:56:59,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:56:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-07 21:56:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-07 21:56:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-07 21:56:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-07 21:56:59,806 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 54 [2019-12-07 21:56:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:59,806 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-07 21:56:59,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:56:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-07 21:56:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 21:56:59,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:59,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:59,807 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-07 21:56:59,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:59,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110845968] [2019-12-07 21:56:59,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:57:00,106 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 21:57:00,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110845968] [2019-12-07 21:57:00,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:57:00,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 21:57:00,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615068183] [2019-12-07 21:57:00,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 21:57:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:57:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 21:57:00,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:57:00,108 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 15 states. [2019-12-07 21:57:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:57:00,715 INFO L93 Difference]: Finished difference Result 359 states and 610 transitions. [2019-12-07 21:57:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 21:57:00,715 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-07 21:57:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:57:00,716 INFO L225 Difference]: With dead ends: 359 [2019-12-07 21:57:00,716 INFO L226 Difference]: Without dead ends: 327 [2019-12-07 21:57:00,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2019-12-07 21:57:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-07 21:57:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2019-12-07 21:57:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-07 21:57:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-07 21:57:00,720 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 54 [2019-12-07 21:57:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:57:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-07 21:57:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 21:57:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-07 21:57:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 21:57:00,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:57:00,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:57:00,721 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:57:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:57:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 3 times [2019-12-07 21:57:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:57:00,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318911912] [2019-12-07 21:57:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:57:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:57:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:57:00,788 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:57:00,788 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:57:00,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t2479~0.base_19| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19|) |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0)) |v_#memory_int_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2479~0.base_19|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19|)) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_~#t2479~0.base=|v_ULTIMATE.start_main_~#t2479~0.base_19|, ULTIMATE.start_main_~#t2479~0.offset=|v_ULTIMATE.start_main_~#t2479~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_20|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2479~0.base, ULTIMATE.start_main_~#t2479~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 21:57:00,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2480~0.base_10|) (= |v_ULTIMATE.start_main_~#t2480~0.offset_9| 0) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10|) |v_ULTIMATE.start_main_~#t2480~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t2480~0.base_10| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2480~0.base_10| 4)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_10|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-07 21:57:00,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= P1Thread1of1ForFork1_~arg.base_Out262501188 |P1Thread1of1ForFork1_#in~arg.base_In262501188|) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out262501188 0)) (= |P1Thread1of1ForFork1_#in~arg.offset_In262501188| P1Thread1of1ForFork1_~arg.offset_Out262501188) (= 2 ~x$w_buff0~0_Out262501188) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out262501188 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out262501188|) (= ~x$w_buff0~0_In262501188 ~x$w_buff1~0_Out262501188) (= 1 ~x$w_buff0_used~0_Out262501188) (= ~x$w_buff0_used~0_In262501188 ~x$w_buff1_used~0_Out262501188) (= (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out262501188 256))) (not (= 0 (mod ~x$w_buff1_used~0_Out262501188 256))))) 1 0) |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out262501188|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In262501188, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In262501188|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In262501188|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In262501188} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out262501188, ~x$w_buff0~0=~x$w_buff0~0_Out262501188, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out262501188, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out262501188|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out262501188, ~x$w_buff1~0=~x$w_buff1~0_Out262501188, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In262501188|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In262501188|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out262501188, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out262501188} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 21:57:00,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1141778247| |P0Thread1of1ForFork0_#t~ite3_Out-1141778247|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1141778247 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1141778247 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1141778247| ~x~0_In-1141778247) .cse0 (or .cse1 .cse2)) (and (= ~x$w_buff1~0_In-1141778247 |P0Thread1of1ForFork0_#t~ite3_Out-1141778247|) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1141778247, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141778247, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141778247, ~x~0=~x~0_In-1141778247} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1141778247|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1141778247|, ~x$w_buff1~0=~x$w_buff1~0_In-1141778247, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141778247, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141778247, ~x~0=~x~0_In-1141778247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 21:57:00,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-134735910 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-134735910 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-134735910| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-134735910 |P1Thread1of1ForFork1_#t~ite11_Out-134735910|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-134735910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-134735910} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-134735910|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-134735910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-134735910} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 21:57:00,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-737869703 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-737869703 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-737869703| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-737869703 |P0Thread1of1ForFork0_#t~ite5_Out-737869703|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-737869703|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 21:57:00,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1897769408 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1897769408 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1897769408 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1897769408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1897769408|)) (and (= ~x$w_buff1_used~0_In-1897769408 |P0Thread1of1ForFork0_#t~ite6_Out-1897769408|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1897769408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1897769408|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1897769408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 21:57:00,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-756635589 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-756635589 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-756635589 |P0Thread1of1ForFork0_#t~ite7_Out-756635589|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-756635589|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-756635589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-756635589} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-756635589, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-756635589|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-756635589} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 21:57:00,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1111310624 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1111310624 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1111310624 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1111310624 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1111310624|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd1~0_In1111310624 |P0Thread1of1ForFork0_#t~ite8_Out1111310624|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1111310624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1111310624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1111310624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111310624} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1111310624, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1111310624|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1111310624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1111310624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111310624} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 21:57:00,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_34|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 21:57:00,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2009218939 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2009218939 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2009218939 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2009218939 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2009218939|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-2009218939 |P1Thread1of1ForFork1_#t~ite12_Out-2009218939|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009218939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2009218939, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2009218939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2009218939} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009218939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2009218939, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2009218939|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2009218939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2009218939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1135533140 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1135533140 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_In1135533140 ~x$r_buff0_thd2~0_Out1135533140))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out1135533140) (not .cse0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1135533140|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-540967426 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-540967426 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-540967426 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-540967426 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-540967426| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-540967426| ~x$r_buff1_thd2~0_In-540967426)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-540967426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-540967426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-540967426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540967426} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-540967426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-540967426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-540967426, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-540967426|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540967426} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1380279285 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1380279285 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1380279285 |ULTIMATE.start_main_#t~ite17_Out1380279285|) (not .cse1)) (and (= ~x~0_In1380279285 |ULTIMATE.start_main_#t~ite17_Out1380279285|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1380279285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1380279285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1380279285, ~x~0=~x~0_In1380279285} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1380279285|, ~x$w_buff1~0=~x$w_buff1~0_In1380279285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1380279285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1380279285, ~x~0=~x~0_In1380279285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-07 21:57:00,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In642634852 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In642634852 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out642634852| ~x$w_buff0_used~0_In642634852) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out642634852| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In642634852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In642634852, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out642634852|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 21:57:00,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1521275523 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1521275523 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1521275523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1521275523| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1521275523| ~x$w_buff1_used~0_In1521275523)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1521275523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1521275523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1521275523|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 21:57:00,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2132147236 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2132147236 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In2132147236 |ULTIMATE.start_main_#t~ite21_Out2132147236|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out2132147236|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2132147236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2132147236, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2132147236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 21:57:00,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In138664350 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In138664350 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In138664350 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In138664350 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out138664350| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out138664350| ~x$r_buff1_thd0~0_In138664350) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In138664350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In138664350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In138664350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In138664350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In138664350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In138664350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In138664350, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out138664350|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In138664350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 21:57:00,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-56748426 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-56748426 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In-56748426 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-56748426 256) 0) (and (= (mod ~x$w_buff1_used~0_In-56748426 256) 0) .cse1))) (= ~x$w_buff1_used~0_In-56748426 |ULTIMATE.start_main_#t~ite37_Out-56748426|) (= |ULTIMATE.start_main_#t~ite38_Out-56748426| |ULTIMATE.start_main_#t~ite37_Out-56748426|)) (and (= |ULTIMATE.start_main_#t~ite37_In-56748426| |ULTIMATE.start_main_#t~ite37_Out-56748426|) (not .cse0) (= ~x$w_buff1_used~0_In-56748426 |ULTIMATE.start_main_#t~ite38_Out-56748426|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-56748426, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-56748426|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-56748426, ~weak$$choice2~0=~weak$$choice2~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-56748426, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-56748426|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-56748426|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-56748426, ~weak$$choice2~0=~weak$$choice2~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 21:57:00,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 21:57:00,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:57:00,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 21:57:00,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:57:00 BasicIcfg [2019-12-07 21:57:00,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:57:00,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:57:00,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:57:00,843 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:57:00,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:56:53" (3/4) ... [2019-12-07 21:57:00,845 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:57:00,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t2479~0.base_19| 4) |v_#length_19|) (= |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2479~0.base_19|) |v_ULTIMATE.start_main_~#t2479~0.offset_16| 0)) |v_#memory_int_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2479~0.base_19|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2479~0.base_19|)) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_137) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_~#t2479~0.base=|v_ULTIMATE.start_main_~#t2479~0.base_19|, ULTIMATE.start_main_~#t2479~0.offset=|v_ULTIMATE.start_main_~#t2479~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~y~0=v_~y~0_77, ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_20|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2479~0.base, ULTIMATE.start_main_~#t2479~0.offset, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 21:57:00,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2480~0.base_10|) (= |v_ULTIMATE.start_main_~#t2480~0.offset_9| 0) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2480~0.base_10|) |v_ULTIMATE.start_main_~#t2480~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t2480~0.base_10| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2480~0.base_10| 4)) (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2480~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2480~0.base=|v_ULTIMATE.start_main_~#t2480~0.base_10|, ULTIMATE.start_main_~#t2480~0.offset=|v_ULTIMATE.start_main_~#t2480~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2480~0.base, ULTIMATE.start_main_~#t2480~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-07 21:57:00,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= P1Thread1of1ForFork1_~arg.base_Out262501188 |P1Thread1of1ForFork1_#in~arg.base_In262501188|) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out262501188 0)) (= |P1Thread1of1ForFork1_#in~arg.offset_In262501188| P1Thread1of1ForFork1_~arg.offset_Out262501188) (= 2 ~x$w_buff0~0_Out262501188) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out262501188 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out262501188|) (= ~x$w_buff0~0_In262501188 ~x$w_buff1~0_Out262501188) (= 1 ~x$w_buff0_used~0_Out262501188) (= ~x$w_buff0_used~0_In262501188 ~x$w_buff1_used~0_Out262501188) (= (ite (not (and (not (= 0 (mod ~x$w_buff0_used~0_Out262501188 256))) (not (= 0 (mod ~x$w_buff1_used~0_Out262501188 256))))) 1 0) |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out262501188|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In262501188, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In262501188|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In262501188|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In262501188} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out262501188, ~x$w_buff0~0=~x$w_buff0~0_Out262501188, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out262501188, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out262501188|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out262501188, ~x$w_buff1~0=~x$w_buff1~0_Out262501188, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In262501188|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In262501188|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out262501188, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out262501188} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 21:57:00,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1141778247| |P0Thread1of1ForFork0_#t~ite3_Out-1141778247|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1141778247 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1141778247 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1141778247| ~x~0_In-1141778247) .cse0 (or .cse1 .cse2)) (and (= ~x$w_buff1~0_In-1141778247 |P0Thread1of1ForFork0_#t~ite3_Out-1141778247|) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1141778247, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141778247, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141778247, ~x~0=~x~0_In-1141778247} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1141778247|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1141778247|, ~x$w_buff1~0=~x$w_buff1~0_In-1141778247, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1141778247, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1141778247, ~x~0=~x~0_In-1141778247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 21:57:00,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-134735910 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-134735910 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-134735910| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-134735910 |P1Thread1of1ForFork1_#t~ite11_Out-134735910|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-134735910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-134735910} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-134735910|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-134735910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-134735910} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 21:57:00,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-737869703 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-737869703 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-737869703| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-737869703 |P0Thread1of1ForFork0_#t~ite5_Out-737869703|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-737869703|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-737869703, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-737869703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 21:57:00,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1897769408 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1897769408 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1897769408 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1897769408 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1897769408|)) (and (= ~x$w_buff1_used~0_In-1897769408 |P0Thread1of1ForFork0_#t~ite6_Out-1897769408|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1897769408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1897769408|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1897769408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1897769408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1897769408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1897769408} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 21:57:00,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-756635589 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-756635589 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-756635589 |P0Thread1of1ForFork0_#t~ite7_Out-756635589|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-756635589|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-756635589, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-756635589} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-756635589, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-756635589|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-756635589} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 21:57:00,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1111310624 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1111310624 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1111310624 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1111310624 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1111310624|)) (and (or .cse3 .cse2) (= ~x$r_buff1_thd1~0_In1111310624 |P0Thread1of1ForFork0_#t~ite8_Out1111310624|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1111310624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1111310624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1111310624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111310624} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1111310624, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1111310624|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1111310624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1111310624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111310624} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 21:57:00,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_34|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 21:57:00,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2009218939 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2009218939 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2009218939 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2009218939 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2009218939|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-2009218939 |P1Thread1of1ForFork1_#t~ite12_Out-2009218939|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009218939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2009218939, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2009218939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2009218939} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2009218939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2009218939, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2009218939|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2009218939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2009218939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 21:57:00,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1135533140 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1135533140 256) 0)) (.cse1 (= ~x$r_buff0_thd2~0_In1135533140 ~x$r_buff0_thd2~0_Out1135533140))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out1135533140) (not .cse0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1135533140|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 21:57:00,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-540967426 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-540967426 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-540967426 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-540967426 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-540967426| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out-540967426| ~x$r_buff1_thd2~0_In-540967426)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-540967426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-540967426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-540967426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540967426} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-540967426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-540967426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-540967426, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-540967426|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540967426} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 21:57:00,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_28|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 21:57:00,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:57:00,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1380279285 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1380279285 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1380279285 |ULTIMATE.start_main_#t~ite17_Out1380279285|) (not .cse1)) (and (= ~x~0_In1380279285 |ULTIMATE.start_main_#t~ite17_Out1380279285|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1380279285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1380279285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1380279285, ~x~0=~x~0_In1380279285} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1380279285|, ~x$w_buff1~0=~x$w_buff1~0_In1380279285, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1380279285, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1380279285, ~x~0=~x~0_In1380279285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-07 21:57:00,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-07 21:57:00,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In642634852 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In642634852 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out642634852| ~x$w_buff0_used~0_In642634852) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out642634852| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In642634852, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In642634852, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out642634852|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In642634852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-07 21:57:00,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1521275523 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1521275523 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1521275523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out1521275523| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1521275523| ~x$w_buff1_used~0_In1521275523)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1521275523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1521275523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1521275523, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1521275523|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 21:57:00,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2132147236 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2132147236 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In2132147236 |ULTIMATE.start_main_#t~ite21_Out2132147236|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out2132147236|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2132147236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2132147236, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2132147236|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2132147236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 21:57:00,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In138664350 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In138664350 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In138664350 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In138664350 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out138664350| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out138664350| ~x$r_buff1_thd0~0_In138664350) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In138664350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In138664350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In138664350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In138664350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In138664350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In138664350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In138664350, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out138664350|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In138664350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 21:57:00,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-56748426 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-56748426 256)))) (or (and (= 0 (mod ~x$r_buff1_thd0~0_In-56748426 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-56748426 256) 0) (and (= (mod ~x$w_buff1_used~0_In-56748426 256) 0) .cse1))) (= ~x$w_buff1_used~0_In-56748426 |ULTIMATE.start_main_#t~ite37_Out-56748426|) (= |ULTIMATE.start_main_#t~ite38_Out-56748426| |ULTIMATE.start_main_#t~ite37_Out-56748426|)) (and (= |ULTIMATE.start_main_#t~ite37_In-56748426| |ULTIMATE.start_main_#t~ite37_Out-56748426|) (not .cse0) (= ~x$w_buff1_used~0_In-56748426 |ULTIMATE.start_main_#t~ite38_Out-56748426|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-56748426, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-56748426|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-56748426, ~weak$$choice2~0=~weak$$choice2~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-56748426, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-56748426|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-56748426|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-56748426, ~weak$$choice2~0=~weak$$choice2~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 21:57:00,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 21:57:00,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:57:00,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 21:57:00,903 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8aef1a66-a858-4209-b7b6-e0021a94c9f3/bin/utaipan/witness.graphml [2019-12-07 21:57:00,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:57:00,904 INFO L168 Benchmark]: Toolchain (without parser) took 8131.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 939.3 MB in the beginning and 860.7 MB in the end (delta: 78.6 MB). Peak memory consumption was 314.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:57:00,904 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:57:00,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:57:00,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.15 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 21:57:00,905 INFO L168 Benchmark]: Boogie Preprocessor took 25.14 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 21:57:00,905 INFO L168 Benchmark]: RCFGBuilder took 367.82 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:57:00,906 INFO L168 Benchmark]: TraceAbstraction took 7247.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.0 GB in the beginning and 877.7 MB in the end (delta: 140.2 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:57:00,906 INFO L168 Benchmark]: Witness Printer took 60.02 ms. Allocated memory is still 1.3 GB. Free memory was 877.7 MB in the beginning and 860.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:57:00,908 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.15 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 25.14 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 367.82 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7247.13 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 127.9 MB). Free memory was 1.0 GB in the beginning and 877.7 MB in the end (delta: 140.2 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. * Witness Printer took 60.02 ms. Allocated memory is still 1.3 GB. Free memory was 877.7 MB in the beginning and 860.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1290 SDtfs, 1054 SDslu, 2774 SDs, 0 SdLazy, 1750 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 27 SyntacticMatches, 13 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11787occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2603 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 90923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...