./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/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 4b6d9fe5b3f6997fe1c1c6909cee29db82762d66 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:13:47,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:13:47,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:13:47,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:13:47,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:13:47,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:13:47,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:13:47,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:13:47,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:13:47,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:13:47,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:13:47,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:13:47,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:13:47,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:13:47,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:13:47,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:13:47,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:13:47,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:13:47,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:13:47,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:13:47,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:13:47,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:13:47,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:13:47,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:13:47,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:13:47,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:13:47,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:13:47,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:13:47,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:13:47,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:13:47,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:13:47,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:13:47,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:13:47,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:13:47,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:13:47,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:13:47,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:13:47,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:13:47,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:13:47,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:13:47,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:13:47,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:13:47,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:13:47,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:13:47,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:13:47,256 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:13:47,256 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:13:47,256 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:13:47,257 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:13:47,257 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:13:47,257 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:13:47,257 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:13:47,257 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:13:47,257 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:13:47,258 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:13:47,258 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:13:47,258 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:13:47,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:13:47,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:13:47,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:13:47,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:13:47,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:13:47,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:13:47,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:13:47,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:13:47,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:13:47,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:13:47,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:13:47,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:13:47,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:13:47,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:13:47,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:13:47,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:13:47,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:13:47,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:13:47,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:13:47,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:13:47,262 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:13:47,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:13:47,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:13:47,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:13:47,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:13:47,263 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_9975292c-df5a-48e2-adce-10f6c7e8b25b/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 -> 4b6d9fe5b3f6997fe1c1c6909cee29db82762d66 [2019-12-07 20:13:47,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:13:47,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:13:47,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:13:47,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:13:47,376 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:13:47,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2019-12-07 20:13:47,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/data/762a9941f/0d2fe5fbd3d84592a34a10b6c195153e/FLAG6edc4ac81 [2019-12-07 20:13:47,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:13:47,884 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/sv-benchmarks/c/pthread-wmm/safe009_power.opt.i [2019-12-07 20:13:47,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/data/762a9941f/0d2fe5fbd3d84592a34a10b6c195153e/FLAG6edc4ac81 [2019-12-07 20:13:47,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/data/762a9941f/0d2fe5fbd3d84592a34a10b6c195153e [2019-12-07 20:13:47,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:13:47,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:13:47,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:13:47,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:13:47,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:13:47,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:13:47" (1/1) ... [2019-12-07 20:13:47,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:47, skipping insertion in model container [2019-12-07 20:13:47,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:13:47" (1/1) ... [2019-12-07 20:13:47,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:13:47,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:13:48,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:13:48,215 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:13:48,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:13:48,308 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:13:48,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48 WrapperNode [2019-12-07 20:13:48,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:13:48,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:13:48,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:13:48,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:13:48,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:13:48,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:13:48,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:13:48,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:13:48,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... [2019-12-07 20:13:48,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:13:48,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:13:48,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:13:48,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:13:48,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:13:48,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:13:48,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:13:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:13:48,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:13:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 20:13:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:13:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:13:48,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:13:48,423 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:13:48,863 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:13:48,863 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:13:48,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:13:48 BoogieIcfgContainer [2019-12-07 20:13:48,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:13:48,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:13:48,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:13:48,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:13:48,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:13:47" (1/3) ... [2019-12-07 20:13:48,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d22f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:13:48, skipping insertion in model container [2019-12-07 20:13:48,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:13:48" (2/3) ... [2019-12-07 20:13:48,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d22f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:13:48, skipping insertion in model container [2019-12-07 20:13:48,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:13:48" (3/3) ... [2019-12-07 20:13:48,869 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2019-12-07 20:13:48,875 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:13:48,875 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:13:48,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:13:48,880 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:13:48,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:13:48,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:13:48,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:13:48,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:13:48,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:13:48,971 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:13:48,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:13:48,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:13:48,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:13:48,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:13:48,983 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 292 transitions [2019-12-07 20:13:48,984 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 234 places, 292 transitions [2019-12-07 20:13:49,059 INFO L134 PetriNetUnfolder]: 68/289 cut-off events. [2019-12-07 20:13:49,059 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:13:49,073 INFO L76 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 289 events. 68/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1259 event pairs. 9/228 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 20:13:49,104 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 234 places, 292 transitions [2019-12-07 20:13:49,155 INFO L134 PetriNetUnfolder]: 68/289 cut-off events. [2019-12-07 20:13:49,155 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:13:49,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 289 events. 68/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1259 event pairs. 9/228 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 20:13:49,196 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31682 [2019-12-07 20:13:49,196 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:13:53,210 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 20:13:53,603 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2019-12-07 20:13:53,746 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-07 20:13:53,778 INFO L206 etLargeBlockEncoding]: Checked pairs total: 168479 [2019-12-07 20:13:53,779 INFO L214 etLargeBlockEncoding]: Total number of compositions: 179 [2019-12-07 20:13:53,781 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 144 transitions [2019-12-07 20:14:31,961 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 220397 states. [2019-12-07 20:14:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 220397 states. [2019-12-07 20:14:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:14:31,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:31,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:14:31,967 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1277248, now seen corresponding path program 1 times [2019-12-07 20:14:31,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:31,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901014927] [2019-12-07 20:14:31,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:32,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901014927] [2019-12-07 20:14:32,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:32,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:14:32,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442156248] [2019-12-07 20:14:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:14:32,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:14:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:32,130 INFO L87 Difference]: Start difference. First operand 220397 states. Second operand 3 states. [2019-12-07 20:14:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:35,101 INFO L93 Difference]: Finished difference Result 218349 states and 982032 transitions. [2019-12-07 20:14:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:14:35,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:14:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:36,038 INFO L225 Difference]: With dead ends: 218349 [2019-12-07 20:14:36,039 INFO L226 Difference]: Without dead ends: 208378 [2019-12-07 20:14:36,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:14:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208378 states. [2019-12-07 20:14:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208378 to 208378. [2019-12-07 20:14:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208378 states. [2019-12-07 20:14:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208378 states to 208378 states and 936818 transitions. [2019-12-07 20:14:47,244 INFO L78 Accepts]: Start accepts. Automaton has 208378 states and 936818 transitions. Word has length 3 [2019-12-07 20:14:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:47,244 INFO L462 AbstractCegarLoop]: Abstraction has 208378 states and 936818 transitions. [2019-12-07 20:14:47,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:14:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 208378 states and 936818 transitions. [2019-12-07 20:14:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:14:47,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:47,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:47,255 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:14:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205327, now seen corresponding path program 1 times [2019-12-07 20:14:47,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:14:47,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906961370] [2019-12-07 20:14:47,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:14:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:47,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906961370] [2019-12-07 20:14:47,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:14:47,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:14:47,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405231805] [2019-12-07 20:14:47,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:14:47,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:14:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:14:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:14:47,338 INFO L87 Difference]: Start difference. First operand 208378 states and 936818 transitions. Second operand 4 states. [2019-12-07 20:14:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:52,213 INFO L93 Difference]: Finished difference Result 340364 states and 1449524 transitions. [2019-12-07 20:14:52,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:14:52,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:14:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:53,152 INFO L225 Difference]: With dead ends: 340364 [2019-12-07 20:14:53,152 INFO L226 Difference]: Without dead ends: 340315 [2019-12-07 20:14:53,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:15:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340315 states. [2019-12-07 20:15:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340315 to 317110. [2019-12-07 20:15:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317110 states. [2019-12-07 20:15:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317110 states to 317110 states and 1364138 transitions. [2019-12-07 20:15:07,776 INFO L78 Accepts]: Start accepts. Automaton has 317110 states and 1364138 transitions. Word has length 13 [2019-12-07 20:15:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:07,777 INFO L462 AbstractCegarLoop]: Abstraction has 317110 states and 1364138 transitions. [2019-12-07 20:15:07,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:15:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 317110 states and 1364138 transitions. [2019-12-07 20:15:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:15:07,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:07,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:07,780 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -109558141, now seen corresponding path program 1 times [2019-12-07 20:15:07,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:07,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505607682] [2019-12-07 20:15:07,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:07,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505607682] [2019-12-07 20:15:07,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:07,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:15:07,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961238967] [2019-12-07 20:15:07,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:15:07,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:15:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:15:07,827 INFO L87 Difference]: Start difference. First operand 317110 states and 1364138 transitions. Second operand 4 states. [2019-12-07 20:15:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:13,983 INFO L93 Difference]: Finished difference Result 444807 states and 1863362 transitions. [2019-12-07 20:15:13,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:15:13,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:15:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:15,232 INFO L225 Difference]: With dead ends: 444807 [2019-12-07 20:15:15,232 INFO L226 Difference]: Without dead ends: 444751 [2019-12-07 20:15:15,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:15:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444751 states. [2019-12-07 20:15:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444751 to 371018. [2019-12-07 20:15:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371018 states. [2019-12-07 20:15:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371018 states to 371018 states and 1583291 transitions. [2019-12-07 20:15:32,449 INFO L78 Accepts]: Start accepts. Automaton has 371018 states and 1583291 transitions. Word has length 13 [2019-12-07 20:15:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:32,449 INFO L462 AbstractCegarLoop]: Abstraction has 371018 states and 1583291 transitions. [2019-12-07 20:15:32,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:15:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 371018 states and 1583291 transitions. [2019-12-07 20:15:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:15:32,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:32,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:32,454 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:32,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:32,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2085368158, now seen corresponding path program 1 times [2019-12-07 20:15:32,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:32,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804102843] [2019-12-07 20:15:32,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:32,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804102843] [2019-12-07 20:15:32,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:32,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:15:32,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825388114] [2019-12-07 20:15:32,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:15:32,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:15:32,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:15:32,491 INFO L87 Difference]: Start difference. First operand 371018 states and 1583291 transitions. Second operand 3 states. [2019-12-07 20:15:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:39,740 INFO L93 Difference]: Finished difference Result 494134 states and 2097383 transitions. [2019-12-07 20:15:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:15:39,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 20:15:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:41,106 INFO L225 Difference]: With dead ends: 494134 [2019-12-07 20:15:41,106 INFO L226 Difference]: Without dead ends: 494134 [2019-12-07 20:15:41,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:15:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494134 states. [2019-12-07 20:15:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494134 to 405381. [2019-12-07 20:15:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405381 states. [2019-12-07 20:15:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405381 states to 405381 states and 1733904 transitions. [2019-12-07 20:15:59,373 INFO L78 Accepts]: Start accepts. Automaton has 405381 states and 1733904 transitions. Word has length 14 [2019-12-07 20:15:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:59,373 INFO L462 AbstractCegarLoop]: Abstraction has 405381 states and 1733904 transitions. [2019-12-07 20:15:59,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:15:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 405381 states and 1733904 transitions. [2019-12-07 20:15:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:15:59,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:59,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:59,377 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2085161729, now seen corresponding path program 1 times [2019-12-07 20:15:59,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:59,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070639235] [2019-12-07 20:15:59,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:59,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070639235] [2019-12-07 20:15:59,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:59,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:15:59,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842063443] [2019-12-07 20:15:59,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:15:59,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:59,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:15:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:15:59,985 INFO L87 Difference]: Start difference. First operand 405381 states and 1733904 transitions. Second operand 5 states. [2019-12-07 20:16:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:07,527 INFO L93 Difference]: Finished difference Result 606078 states and 2522493 transitions. [2019-12-07 20:16:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:16:07,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 20:16:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:09,497 INFO L225 Difference]: With dead ends: 606078 [2019-12-07 20:16:09,497 INFO L226 Difference]: Without dead ends: 606078 [2019-12-07 20:16:09,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:16:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606078 states. [2019-12-07 20:16:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606078 to 424151. [2019-12-07 20:16:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424151 states. [2019-12-07 20:16:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424151 states to 424151 states and 1808031 transitions. [2019-12-07 20:16:30,222 INFO L78 Accepts]: Start accepts. Automaton has 424151 states and 1808031 transitions. Word has length 14 [2019-12-07 20:16:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:30,223 INFO L462 AbstractCegarLoop]: Abstraction has 424151 states and 1808031 transitions. [2019-12-07 20:16:30,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:16:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 424151 states and 1808031 transitions. [2019-12-07 20:16:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:16:30,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:30,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:30,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -515013518, now seen corresponding path program 1 times [2019-12-07 20:16:30,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:30,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753382127] [2019-12-07 20:16:30,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:30,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753382127] [2019-12-07 20:16:30,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:30,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:16:30,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211031078] [2019-12-07 20:16:30,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:16:30,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:16:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:16:30,279 INFO L87 Difference]: Start difference. First operand 424151 states and 1808031 transitions. Second operand 5 states. [2019-12-07 20:16:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:38,756 INFO L93 Difference]: Finished difference Result 576579 states and 2414508 transitions. [2019-12-07 20:16:38,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:16:38,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 20:16:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:40,368 INFO L225 Difference]: With dead ends: 576579 [2019-12-07 20:16:40,368 INFO L226 Difference]: Without dead ends: 576579 [2019-12-07 20:16:40,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:16:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576579 states. [2019-12-07 20:16:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576579 to 442172. [2019-12-07 20:16:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442172 states. [2019-12-07 20:17:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442172 states to 442172 states and 1884421 transitions. [2019-12-07 20:17:01,083 INFO L78 Accepts]: Start accepts. Automaton has 442172 states and 1884421 transitions. Word has length 14 [2019-12-07 20:17:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:17:01,083 INFO L462 AbstractCegarLoop]: Abstraction has 442172 states and 1884421 transitions. [2019-12-07 20:17:01,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:17:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 442172 states and 1884421 transitions. [2019-12-07 20:17:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:17:01,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:17:01,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:17:01,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:17:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:17:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1574642654, now seen corresponding path program 1 times [2019-12-07 20:17:01,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:17:01,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740652928] [2019-12-07 20:17:01,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:17:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:17:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:17:01,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740652928] [2019-12-07 20:17:01,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:17:01,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:17:01,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730702375] [2019-12-07 20:17:01,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:17:01,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:17:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:17:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:17:01,166 INFO L87 Difference]: Start difference. First operand 442172 states and 1884421 transitions. Second operand 5 states. [2019-12-07 20:17:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:17:10,318 INFO L93 Difference]: Finished difference Result 633026 states and 2637494 transitions. [2019-12-07 20:17:10,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:17:10,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 20:17:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:17:12,020 INFO L225 Difference]: With dead ends: 633026 [2019-12-07 20:17:12,020 INFO L226 Difference]: Without dead ends: 632935 [2019-12-07 20:17:12,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:17:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632935 states. [2019-12-07 20:17:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632935 to 470095. [2019-12-07 20:17:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470095 states. [2019-12-07 20:17:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470095 states to 470095 states and 1996914 transitions. [2019-12-07 20:17:34,687 INFO L78 Accepts]: Start accepts. Automaton has 470095 states and 1996914 transitions. Word has length 19 [2019-12-07 20:17:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:17:34,687 INFO L462 AbstractCegarLoop]: Abstraction has 470095 states and 1996914 transitions. [2019-12-07 20:17:34,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:17:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 470095 states and 1996914 transitions. [2019-12-07 20:17:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:17:34,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:17:34,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:17:34,728 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:17:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:17:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash -15165950, now seen corresponding path program 1 times [2019-12-07 20:17:34,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:17:34,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039781783] [2019-12-07 20:17:34,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:17:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:17:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:17:34,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039781783] [2019-12-07 20:17:34,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:17:34,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:17:34,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768525364] [2019-12-07 20:17:34,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:17:34,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:17:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:17:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:17:34,782 INFO L87 Difference]: Start difference. First operand 470095 states and 1996914 transitions. Second operand 3 states. [2019-12-07 20:17:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:17:41,604 INFO L93 Difference]: Finished difference Result 447726 states and 1889629 transitions. [2019-12-07 20:17:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:17:41,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:17:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:17:42,884 INFO L225 Difference]: With dead ends: 447726 [2019-12-07 20:17:42,884 INFO L226 Difference]: Without dead ends: 447726 [2019-12-07 20:17:42,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:17:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447726 states. [2019-12-07 20:17:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447726 to 444654. [2019-12-07 20:17:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444654 states. [2019-12-07 20:18:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444654 states to 444654 states and 1878273 transitions. [2019-12-07 20:18:00,153 INFO L78 Accepts]: Start accepts. Automaton has 444654 states and 1878273 transitions. Word has length 20 [2019-12-07 20:18:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:00,153 INFO L462 AbstractCegarLoop]: Abstraction has 444654 states and 1878273 transitions. [2019-12-07 20:18:00,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:18:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 444654 states and 1878273 transitions. [2019-12-07 20:18:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:18:00,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:00,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:00,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:18:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash -993714604, now seen corresponding path program 1 times [2019-12-07 20:18:00,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:00,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982178067] [2019-12-07 20:18:00,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:18:00,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982178067] [2019-12-07 20:18:00,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:00,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:18:00,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381624317] [2019-12-07 20:18:00,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:18:00,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:18:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:18:00,235 INFO L87 Difference]: Start difference. First operand 444654 states and 1878273 transitions. Second operand 4 states. [2019-12-07 20:18:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:02,931 INFO L93 Difference]: Finished difference Result 463272 states and 1937868 transitions. [2019-12-07 20:18:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:18:02,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 20:18:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:04,721 INFO L225 Difference]: With dead ends: 463272 [2019-12-07 20:18:04,721 INFO L226 Difference]: Without dead ends: 444025 [2019-12-07 20:18:04,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:18:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444025 states. [2019-12-07 20:18:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444025 to 444025. [2019-12-07 20:18:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444025 states. [2019-12-07 20:18:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444025 states to 444025 states and 1873398 transitions. [2019-12-07 20:18:26,930 INFO L78 Accepts]: Start accepts. Automaton has 444025 states and 1873398 transitions. Word has length 20 [2019-12-07 20:18:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:26,931 INFO L462 AbstractCegarLoop]: Abstraction has 444025 states and 1873398 transitions. [2019-12-07 20:18:26,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:18:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 444025 states and 1873398 transitions. [2019-12-07 20:18:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:18:26,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:26,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:26,969 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:18:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash -16165056, now seen corresponding path program 1 times [2019-12-07 20:18:26,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:26,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877149943] [2019-12-07 20:18:26,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:18:27,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877149943] [2019-12-07 20:18:27,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:27,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:18:27,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786507875] [2019-12-07 20:18:27,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:18:27,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:18:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:18:27,020 INFO L87 Difference]: Start difference. First operand 444025 states and 1873398 transitions. Second operand 6 states. [2019-12-07 20:18:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:29,833 INFO L93 Difference]: Finished difference Result 480611 states and 1993949 transitions. [2019-12-07 20:18:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:18:29,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 20:18:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:31,564 INFO L225 Difference]: With dead ends: 480611 [2019-12-07 20:18:31,564 INFO L226 Difference]: Without dead ends: 429124 [2019-12-07 20:18:31,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:18:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429124 states. [2019-12-07 20:18:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429124 to 424129. [2019-12-07 20:18:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424129 states. [2019-12-07 20:18:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424129 states to 424129 states and 1766977 transitions. [2019-12-07 20:18:52,703 INFO L78 Accepts]: Start accepts. Automaton has 424129 states and 1766977 transitions. Word has length 21 [2019-12-07 20:18:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:52,703 INFO L462 AbstractCegarLoop]: Abstraction has 424129 states and 1766977 transitions. [2019-12-07 20:18:52,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:18:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 424129 states and 1766977 transitions. [2019-12-07 20:18:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:18:52,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:52,751 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] [2019-12-07 20:18:52,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:18:52,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash -514259038, now seen corresponding path program 1 times [2019-12-07 20:18:52,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:52,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882289160] [2019-12-07 20:18:52,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:18:52,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882289160] [2019-12-07 20:18:52,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:52,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:18:52,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284569253] [2019-12-07 20:18:52,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:18:52,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:52,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:18:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:18:52,783 INFO L87 Difference]: Start difference. First operand 424129 states and 1766977 transitions. Second operand 3 states. [2019-12-07 20:18:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:55,022 INFO L93 Difference]: Finished difference Result 360667 states and 1496366 transitions. [2019-12-07 20:18:55,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:18:55,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 20:18:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:56,499 INFO L225 Difference]: With dead ends: 360667 [2019-12-07 20:18:56,499 INFO L226 Difference]: Without dead ends: 360667 [2019-12-07 20:18:56,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360667 states. [2019-12-07 20:19:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360667 to 360667. [2019-12-07 20:19:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360667 states. [2019-12-07 20:19:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360667 states to 360667 states and 1496366 transitions. [2019-12-07 20:19:10,954 INFO L78 Accepts]: Start accepts. Automaton has 360667 states and 1496366 transitions. Word has length 22 [2019-12-07 20:19:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:10,954 INFO L462 AbstractCegarLoop]: Abstraction has 360667 states and 1496366 transitions. [2019-12-07 20:19:10,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 360667 states and 1496366 transitions. [2019-12-07 20:19:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:19:11,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:11,004 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] [2019-12-07 20:19:11,004 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash 522968625, now seen corresponding path program 1 times [2019-12-07 20:19:11,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:11,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280604830] [2019-12-07 20:19:11,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:11,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280604830] [2019-12-07 20:19:11,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:11,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:11,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714222471] [2019-12-07 20:19:11,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:11,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:11,044 INFO L87 Difference]: Start difference. First operand 360667 states and 1496366 transitions. Second operand 4 states. [2019-12-07 20:19:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:11,378 INFO L93 Difference]: Finished difference Result 94068 states and 327648 transitions. [2019-12-07 20:19:11,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:11,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 20:19:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:11,499 INFO L225 Difference]: With dead ends: 94068 [2019-12-07 20:19:11,499 INFO L226 Difference]: Without dead ends: 72392 [2019-12-07 20:19:11,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72392 states. [2019-12-07 20:19:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72392 to 72280. [2019-12-07 20:19:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72280 states. [2019-12-07 20:19:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72280 states to 72280 states and 238126 transitions. [2019-12-07 20:19:12,667 INFO L78 Accepts]: Start accepts. Automaton has 72280 states and 238126 transitions. Word has length 22 [2019-12-07 20:19:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:12,668 INFO L462 AbstractCegarLoop]: Abstraction has 72280 states and 238126 transitions. [2019-12-07 20:19:12,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 72280 states and 238126 transitions. [2019-12-07 20:19:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:19:12,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:12,676 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] [2019-12-07 20:19:12,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash -241741821, now seen corresponding path program 1 times [2019-12-07 20:19:12,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:12,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901037354] [2019-12-07 20:19:12,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:12,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901037354] [2019-12-07 20:19:12,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:12,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:12,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314845248] [2019-12-07 20:19:12,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:12,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:12,727 INFO L87 Difference]: Start difference. First operand 72280 states and 238126 transitions. Second operand 6 states. [2019-12-07 20:19:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:14,958 INFO L93 Difference]: Finished difference Result 101253 states and 324255 transitions. [2019-12-07 20:19:14,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:19:14,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 20:19:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:15,118 INFO L225 Difference]: With dead ends: 101253 [2019-12-07 20:19:15,118 INFO L226 Difference]: Without dead ends: 101190 [2019-12-07 20:19:15,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:19:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101190 states. [2019-12-07 20:19:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101190 to 76357. [2019-12-07 20:19:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76357 states. [2019-12-07 20:19:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76357 states to 76357 states and 250662 transitions. [2019-12-07 20:19:16,558 INFO L78 Accepts]: Start accepts. Automaton has 76357 states and 250662 transitions. Word has length 22 [2019-12-07 20:19:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:16,558 INFO L462 AbstractCegarLoop]: Abstraction has 76357 states and 250662 transitions. [2019-12-07 20:19:16,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 76357 states and 250662 transitions. [2019-12-07 20:19:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:19:16,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:16,567 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] [2019-12-07 20:19:16,567 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash -786938448, now seen corresponding path program 1 times [2019-12-07 20:19:16,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:16,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938555336] [2019-12-07 20:19:16,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:16,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938555336] [2019-12-07 20:19:16,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:16,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:16,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819925124] [2019-12-07 20:19:16,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:16,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:16,626 INFO L87 Difference]: Start difference. First operand 76357 states and 250662 transitions. Second operand 6 states. [2019-12-07 20:19:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:17,888 INFO L93 Difference]: Finished difference Result 105471 states and 337763 transitions. [2019-12-07 20:19:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:19:17,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 20:19:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:18,061 INFO L225 Difference]: With dead ends: 105471 [2019-12-07 20:19:18,061 INFO L226 Difference]: Without dead ends: 105408 [2019-12-07 20:19:18,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:19:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105408 states. [2019-12-07 20:19:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105408 to 73954. [2019-12-07 20:19:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73954 states. [2019-12-07 20:19:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73954 states to 73954 states and 242703 transitions. [2019-12-07 20:19:19,505 INFO L78 Accepts]: Start accepts. Automaton has 73954 states and 242703 transitions. Word has length 22 [2019-12-07 20:19:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:19,505 INFO L462 AbstractCegarLoop]: Abstraction has 73954 states and 242703 transitions. [2019-12-07 20:19:19,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73954 states and 242703 transitions. [2019-12-07 20:19:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 20:19:19,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:19,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:19,520 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1507735935, now seen corresponding path program 1 times [2019-12-07 20:19:19,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:19,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457973191] [2019-12-07 20:19:19,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:19,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457973191] [2019-12-07 20:19:19,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:19,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:19,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9566633] [2019-12-07 20:19:19,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:19,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:19,598 INFO L87 Difference]: Start difference. First operand 73954 states and 242703 transitions. Second operand 6 states. [2019-12-07 20:19:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:20,297 INFO L93 Difference]: Finished difference Result 100685 states and 323443 transitions. [2019-12-07 20:19:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:19:20,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 20:19:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:20,452 INFO L225 Difference]: With dead ends: 100685 [2019-12-07 20:19:20,452 INFO L226 Difference]: Without dead ends: 100428 [2019-12-07 20:19:20,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100428 states. [2019-12-07 20:19:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100428 to 77729. [2019-12-07 20:19:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77729 states. [2019-12-07 20:19:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77729 states to 77729 states and 254367 transitions. [2019-12-07 20:19:21,881 INFO L78 Accepts]: Start accepts. Automaton has 77729 states and 254367 transitions. Word has length 25 [2019-12-07 20:19:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:21,881 INFO L462 AbstractCegarLoop]: Abstraction has 77729 states and 254367 transitions. [2019-12-07 20:19:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 77729 states and 254367 transitions. [2019-12-07 20:19:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:19:21,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:21,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:21,898 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:21,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1209681835, now seen corresponding path program 1 times [2019-12-07 20:19:21,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:21,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415990916] [2019-12-07 20:19:21,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:21,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415990916] [2019-12-07 20:19:21,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:21,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:21,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598015892] [2019-12-07 20:19:21,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:21,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:21,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:21,950 INFO L87 Difference]: Start difference. First operand 77729 states and 254367 transitions. Second operand 5 states. [2019-12-07 20:19:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:22,686 INFO L93 Difference]: Finished difference Result 120903 states and 395048 transitions. [2019-12-07 20:19:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:19:22,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 20:19:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:22,882 INFO L225 Difference]: With dead ends: 120903 [2019-12-07 20:19:22,882 INFO L226 Difference]: Without dead ends: 120586 [2019-12-07 20:19:22,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120586 states. [2019-12-07 20:19:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120586 to 77711. [2019-12-07 20:19:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77711 states. [2019-12-07 20:19:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77711 states to 77711 states and 255195 transitions. [2019-12-07 20:19:24,488 INFO L78 Accepts]: Start accepts. Automaton has 77711 states and 255195 transitions. Word has length 26 [2019-12-07 20:19:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:24,488 INFO L462 AbstractCegarLoop]: Abstraction has 77711 states and 255195 transitions. [2019-12-07 20:19:24,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 77711 states and 255195 transitions. [2019-12-07 20:19:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:19:24,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:24,529 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] [2019-12-07 20:19:24,529 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash -962432829, now seen corresponding path program 1 times [2019-12-07 20:19:24,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:24,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802297647] [2019-12-07 20:19:24,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:24,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802297647] [2019-12-07 20:19:24,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:24,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:19:24,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581862221] [2019-12-07 20:19:24,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:19:24,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:24,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:19:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:24,637 INFO L87 Difference]: Start difference. First operand 77711 states and 255195 transitions. Second operand 7 states. [2019-12-07 20:19:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:26,176 INFO L93 Difference]: Finished difference Result 107173 states and 342905 transitions. [2019-12-07 20:19:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 20:19:26,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 20:19:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:26,353 INFO L225 Difference]: With dead ends: 107173 [2019-12-07 20:19:26,353 INFO L226 Difference]: Without dead ends: 106706 [2019-12-07 20:19:26,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:19:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106706 states. [2019-12-07 20:19:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106706 to 77694. [2019-12-07 20:19:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77694 states. [2019-12-07 20:19:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77694 states to 77694 states and 254834 transitions. [2019-12-07 20:19:27,849 INFO L78 Accepts]: Start accepts. Automaton has 77694 states and 254834 transitions. Word has length 33 [2019-12-07 20:19:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:27,850 INFO L462 AbstractCegarLoop]: Abstraction has 77694 states and 254834 transitions. [2019-12-07 20:19:27,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:19:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 77694 states and 254834 transitions. [2019-12-07 20:19:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:27,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:27,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:27,892 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1084459431, now seen corresponding path program 1 times [2019-12-07 20:19:27,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:27,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564396727] [2019-12-07 20:19:27,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:27,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564396727] [2019-12-07 20:19:27,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:27,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481605344] [2019-12-07 20:19:27,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:27,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:27,959 INFO L87 Difference]: Start difference. First operand 77694 states and 254834 transitions. Second operand 6 states. [2019-12-07 20:19:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:29,093 INFO L93 Difference]: Finished difference Result 135983 states and 441107 transitions. [2019-12-07 20:19:29,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:19:29,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 20:19:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:29,303 INFO L225 Difference]: With dead ends: 135983 [2019-12-07 20:19:29,304 INFO L226 Difference]: Without dead ends: 135711 [2019-12-07 20:19:29,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:19:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135711 states. [2019-12-07 20:19:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135711 to 79002. [2019-12-07 20:19:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79002 states. [2019-12-07 20:19:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79002 states to 79002 states and 259476 transitions. [2019-12-07 20:19:30,976 INFO L78 Accepts]: Start accepts. Automaton has 79002 states and 259476 transitions. Word has length 34 [2019-12-07 20:19:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:30,976 INFO L462 AbstractCegarLoop]: Abstraction has 79002 states and 259476 transitions. [2019-12-07 20:19:30,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 79002 states and 259476 transitions. [2019-12-07 20:19:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:31,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:31,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:31,159 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 739698598, now seen corresponding path program 1 times [2019-12-07 20:19:31,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:31,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345901210] [2019-12-07 20:19:31,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:31,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345901210] [2019-12-07 20:19:31,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:31,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:31,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891415682] [2019-12-07 20:19:31,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:19:31,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:19:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:31,207 INFO L87 Difference]: Start difference. First operand 79002 states and 259476 transitions. Second operand 5 states. [2019-12-07 20:19:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:31,331 INFO L93 Difference]: Finished difference Result 35726 states and 112985 transitions. [2019-12-07 20:19:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:31,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 20:19:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:31,373 INFO L225 Difference]: With dead ends: 35726 [2019-12-07 20:19:31,374 INFO L226 Difference]: Without dead ends: 31469 [2019-12-07 20:19:31,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:19:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31469 states. [2019-12-07 20:19:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31469 to 29463. [2019-12-07 20:19:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29463 states. [2019-12-07 20:19:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29463 states to 29463 states and 93283 transitions. [2019-12-07 20:19:31,815 INFO L78 Accepts]: Start accepts. Automaton has 29463 states and 93283 transitions. Word has length 34 [2019-12-07 20:19:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:31,815 INFO L462 AbstractCegarLoop]: Abstraction has 29463 states and 93283 transitions. [2019-12-07 20:19:31,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:19:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 29463 states and 93283 transitions. [2019-12-07 20:19:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:31,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:31,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:31,838 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:31,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1558074023, now seen corresponding path program 2 times [2019-12-07 20:19:31,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:31,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689779498] [2019-12-07 20:19:31,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:31,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689779498] [2019-12-07 20:19:31,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:31,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:31,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817799323] [2019-12-07 20:19:31,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:31,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:31,898 INFO L87 Difference]: Start difference. First operand 29463 states and 93283 transitions. Second operand 6 states. [2019-12-07 20:19:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:32,544 INFO L93 Difference]: Finished difference Result 44129 states and 136384 transitions. [2019-12-07 20:19:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:19:32,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 20:19:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:32,596 INFO L225 Difference]: With dead ends: 44129 [2019-12-07 20:19:32,596 INFO L226 Difference]: Without dead ends: 43975 [2019-12-07 20:19:32,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:19:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43975 states. [2019-12-07 20:19:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43975 to 29239. [2019-12-07 20:19:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29239 states. [2019-12-07 20:19:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29239 states to 29239 states and 92486 transitions. [2019-12-07 20:19:33,115 INFO L78 Accepts]: Start accepts. Automaton has 29239 states and 92486 transitions. Word has length 34 [2019-12-07 20:19:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:33,115 INFO L462 AbstractCegarLoop]: Abstraction has 29239 states and 92486 transitions. [2019-12-07 20:19:33,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29239 states and 92486 transitions. [2019-12-07 20:19:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:19:33,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:33,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:33,137 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1655861333, now seen corresponding path program 3 times [2019-12-07 20:19:33,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:33,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688536932] [2019-12-07 20:19:33,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:33,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688536932] [2019-12-07 20:19:33,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:33,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 20:19:33,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232346076] [2019-12-07 20:19:33,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 20:19:33,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:33,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 20:19:33,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:19:33,282 INFO L87 Difference]: Start difference. First operand 29239 states and 92486 transitions. Second operand 11 states. [2019-12-07 20:19:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:35,183 INFO L93 Difference]: Finished difference Result 80364 states and 246718 transitions. [2019-12-07 20:19:35,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:19:35,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-07 20:19:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:35,274 INFO L225 Difference]: With dead ends: 80364 [2019-12-07 20:19:35,274 INFO L226 Difference]: Without dead ends: 80163 [2019-12-07 20:19:35,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-12-07 20:19:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80163 states. [2019-12-07 20:19:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80163 to 34389. [2019-12-07 20:19:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34389 states. [2019-12-07 20:19:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34389 states to 34389 states and 109446 transitions. [2019-12-07 20:19:36,084 INFO L78 Accepts]: Start accepts. Automaton has 34389 states and 109446 transitions. Word has length 34 [2019-12-07 20:19:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:36,085 INFO L462 AbstractCegarLoop]: Abstraction has 34389 states and 109446 transitions. [2019-12-07 20:19:36,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 20:19:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34389 states and 109446 transitions. [2019-12-07 20:19:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 20:19:36,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:36,119 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] [2019-12-07 20:19:36,119 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2052165658, now seen corresponding path program 1 times [2019-12-07 20:19:36,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:36,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912375550] [2019-12-07 20:19:36,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:36,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912375550] [2019-12-07 20:19:36,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:36,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:36,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676162584] [2019-12-07 20:19:36,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:36,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:36,184 INFO L87 Difference]: Start difference. First operand 34389 states and 109446 transitions. Second operand 6 states. [2019-12-07 20:19:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:36,314 INFO L93 Difference]: Finished difference Result 32127 states and 104174 transitions. [2019-12-07 20:19:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:19:36,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 20:19:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:36,355 INFO L225 Difference]: With dead ends: 32127 [2019-12-07 20:19:36,355 INFO L226 Difference]: Without dead ends: 31888 [2019-12-07 20:19:36,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31888 states. [2019-12-07 20:19:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31888 to 27661. [2019-12-07 20:19:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27661 states. [2019-12-07 20:19:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27661 states to 27661 states and 90916 transitions. [2019-12-07 20:19:36,809 INFO L78 Accepts]: Start accepts. Automaton has 27661 states and 90916 transitions. Word has length 51 [2019-12-07 20:19:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:36,809 INFO L462 AbstractCegarLoop]: Abstraction has 27661 states and 90916 transitions. [2019-12-07 20:19:36,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 27661 states and 90916 transitions. [2019-12-07 20:19:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:19:36,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:36,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:36,839 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 804306447, now seen corresponding path program 1 times [2019-12-07 20:19:36,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:36,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969378526] [2019-12-07 20:19:36,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:36,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969378526] [2019-12-07 20:19:36,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:36,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:36,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145384771] [2019-12-07 20:19:36,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:36,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:36,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:36,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:36,867 INFO L87 Difference]: Start difference. First operand 27661 states and 90916 transitions. Second operand 3 states. [2019-12-07 20:19:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:37,087 INFO L93 Difference]: Finished difference Result 33690 states and 110084 transitions. [2019-12-07 20:19:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:37,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 20:19:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:37,131 INFO L225 Difference]: With dead ends: 33690 [2019-12-07 20:19:37,131 INFO L226 Difference]: Without dead ends: 33606 [2019-12-07 20:19:37,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33606 states. [2019-12-07 20:19:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33606 to 28308. [2019-12-07 20:19:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28308 states. [2019-12-07 20:19:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28308 states to 28308 states and 92923 transitions. [2019-12-07 20:19:37,713 INFO L78 Accepts]: Start accepts. Automaton has 28308 states and 92923 transitions. Word has length 67 [2019-12-07 20:19:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:37,713 INFO L462 AbstractCegarLoop]: Abstraction has 28308 states and 92923 transitions. [2019-12-07 20:19:37,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28308 states and 92923 transitions. [2019-12-07 20:19:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 20:19:37,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:37,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:37,741 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash 288228535, now seen corresponding path program 2 times [2019-12-07 20:19:37,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:37,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332601881] [2019-12-07 20:19:37,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:37,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332601881] [2019-12-07 20:19:37,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:37,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:37,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728893149] [2019-12-07 20:19:37,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:37,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:37,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:37,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:37,777 INFO L87 Difference]: Start difference. First operand 28308 states and 92923 transitions. Second operand 3 states. [2019-12-07 20:19:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:37,917 INFO L93 Difference]: Finished difference Result 34459 states and 110291 transitions. [2019-12-07 20:19:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:37,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 20:19:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:37,962 INFO L225 Difference]: With dead ends: 34459 [2019-12-07 20:19:37,962 INFO L226 Difference]: Without dead ends: 34459 [2019-12-07 20:19:37,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34459 states. [2019-12-07 20:19:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34459 to 29987. [2019-12-07 20:19:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29987 states. [2019-12-07 20:19:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29987 states to 29987 states and 96809 transitions. [2019-12-07 20:19:38,453 INFO L78 Accepts]: Start accepts. Automaton has 29987 states and 96809 transitions. Word has length 67 [2019-12-07 20:19:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:38,453 INFO L462 AbstractCegarLoop]: Abstraction has 29987 states and 96809 transitions. [2019-12-07 20:19:38,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 29987 states and 96809 transitions. [2019-12-07 20:19:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:19:38,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:38,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:38,484 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash 554181365, now seen corresponding path program 1 times [2019-12-07 20:19:38,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:38,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098510218] [2019-12-07 20:19:38,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:38,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098510218] [2019-12-07 20:19:38,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:38,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:38,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895609341] [2019-12-07 20:19:38,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:38,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:38,522 INFO L87 Difference]: Start difference. First operand 29987 states and 96809 transitions. Second operand 3 states. [2019-12-07 20:19:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:38,614 INFO L93 Difference]: Finished difference Result 29986 states and 96807 transitions. [2019-12-07 20:19:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:38,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 20:19:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:38,653 INFO L225 Difference]: With dead ends: 29986 [2019-12-07 20:19:38,654 INFO L226 Difference]: Without dead ends: 29986 [2019-12-07 20:19:38,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29986 states. [2019-12-07 20:19:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29986 to 29986. [2019-12-07 20:19:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29986 states. [2019-12-07 20:19:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29986 states to 29986 states and 96807 transitions. [2019-12-07 20:19:39,098 INFO L78 Accepts]: Start accepts. Automaton has 29986 states and 96807 transitions. Word has length 68 [2019-12-07 20:19:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:39,099 INFO L462 AbstractCegarLoop]: Abstraction has 29986 states and 96807 transitions. [2019-12-07 20:19:39,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29986 states and 96807 transitions. [2019-12-07 20:19:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:19:39,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:39,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:39,130 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -13389171, now seen corresponding path program 1 times [2019-12-07 20:19:39,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:39,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685004951] [2019-12-07 20:19:39,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:39,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685004951] [2019-12-07 20:19:39,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:39,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:19:39,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549990475] [2019-12-07 20:19:39,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:19:39,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:19:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:39,167 INFO L87 Difference]: Start difference. First operand 29986 states and 96807 transitions. Second operand 3 states. [2019-12-07 20:19:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:39,252 INFO L93 Difference]: Finished difference Result 29860 states and 95169 transitions. [2019-12-07 20:19:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:19:39,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 20:19:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:39,288 INFO L225 Difference]: With dead ends: 29860 [2019-12-07 20:19:39,288 INFO L226 Difference]: Without dead ends: 29860 [2019-12-07 20:19:39,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:19:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29860 states. [2019-12-07 20:19:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29860 to 28896. [2019-12-07 20:19:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28896 states. [2019-12-07 20:19:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28896 states to 28896 states and 92313 transitions. [2019-12-07 20:19:39,706 INFO L78 Accepts]: Start accepts. Automaton has 28896 states and 92313 transitions. Word has length 69 [2019-12-07 20:19:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:39,706 INFO L462 AbstractCegarLoop]: Abstraction has 28896 states and 92313 transitions. [2019-12-07 20:19:39,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:19:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28896 states and 92313 transitions. [2019-12-07 20:19:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:39,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:39,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:39,738 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1325639960, now seen corresponding path program 1 times [2019-12-07 20:19:39,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:39,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102764381] [2019-12-07 20:19:39,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:39,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102764381] [2019-12-07 20:19:39,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:39,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:39,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356455341] [2019-12-07 20:19:39,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:39,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:39,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:39,779 INFO L87 Difference]: Start difference. First operand 28896 states and 92313 transitions. Second operand 4 states. [2019-12-07 20:19:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:40,021 INFO L93 Difference]: Finished difference Result 37148 states and 116725 transitions. [2019-12-07 20:19:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:19:40,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 20:19:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:40,066 INFO L225 Difference]: With dead ends: 37148 [2019-12-07 20:19:40,067 INFO L226 Difference]: Without dead ends: 37148 [2019-12-07 20:19:40,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:19:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37148 states. [2019-12-07 20:19:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37148 to 28470. [2019-12-07 20:19:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28470 states. [2019-12-07 20:19:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28470 states to 28470 states and 90955 transitions. [2019-12-07 20:19:40,585 INFO L78 Accepts]: Start accepts. Automaton has 28470 states and 90955 transitions. Word has length 70 [2019-12-07 20:19:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:40,585 INFO L462 AbstractCegarLoop]: Abstraction has 28470 states and 90955 transitions. [2019-12-07 20:19:40,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28470 states and 90955 transitions. [2019-12-07 20:19:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:40,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:40,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:40,614 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1725783300, now seen corresponding path program 2 times [2019-12-07 20:19:40,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:40,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575685511] [2019-12-07 20:19:40,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:40,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575685511] [2019-12-07 20:19:40,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:40,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:19:40,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751298612] [2019-12-07 20:19:40,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:19:40,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:19:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:19:40,652 INFO L87 Difference]: Start difference. First operand 28470 states and 90955 transitions. Second operand 4 states. [2019-12-07 20:19:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:40,775 INFO L93 Difference]: Finished difference Result 28470 states and 90539 transitions. [2019-12-07 20:19:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:19:40,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 20:19:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:40,810 INFO L225 Difference]: With dead ends: 28470 [2019-12-07 20:19:40,810 INFO L226 Difference]: Without dead ends: 28470 [2019-12-07 20:19:40,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 20:19:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28470 states. [2019-12-07 20:19:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28470 to 25163. [2019-12-07 20:19:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25163 states. [2019-12-07 20:19:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25163 states to 25163 states and 79791 transitions. [2019-12-07 20:19:41,215 INFO L78 Accepts]: Start accepts. Automaton has 25163 states and 79791 transitions. Word has length 70 [2019-12-07 20:19:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:41,215 INFO L462 AbstractCegarLoop]: Abstraction has 25163 states and 79791 transitions. [2019-12-07 20:19:41,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:19:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 25163 states and 79791 transitions. [2019-12-07 20:19:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:41,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:41,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:41,243 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1623819996, now seen corresponding path program 1 times [2019-12-07 20:19:41,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:41,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866234666] [2019-12-07 20:19:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:41,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866234666] [2019-12-07 20:19:41,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:41,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:19:41,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272890703] [2019-12-07 20:19:41,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:41,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:41,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:41,322 INFO L87 Difference]: Start difference. First operand 25163 states and 79791 transitions. Second operand 6 states. [2019-12-07 20:19:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:41,466 INFO L93 Difference]: Finished difference Result 45766 states and 144448 transitions. [2019-12-07 20:19:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:19:41,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 20:19:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:41,491 INFO L225 Difference]: With dead ends: 45766 [2019-12-07 20:19:41,491 INFO L226 Difference]: Without dead ends: 21876 [2019-12-07 20:19:41,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:19:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21876 states. [2019-12-07 20:19:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21876 to 21732. [2019-12-07 20:19:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21732 states. [2019-12-07 20:19:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21732 states to 21732 states and 68382 transitions. [2019-12-07 20:19:41,804 INFO L78 Accepts]: Start accepts. Automaton has 21732 states and 68382 transitions. Word has length 70 [2019-12-07 20:19:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:41,804 INFO L462 AbstractCegarLoop]: Abstraction has 21732 states and 68382 transitions. [2019-12-07 20:19:41,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21732 states and 68382 transitions. [2019-12-07 20:19:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:41,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:41,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:41,823 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:41,824 INFO L82 PathProgramCache]: Analyzing trace with hash -182208042, now seen corresponding path program 2 times [2019-12-07 20:19:41,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:41,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697133138] [2019-12-07 20:19:41,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:19:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:19:41,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697133138] [2019-12-07 20:19:41,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:19:41,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:19:41,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949470688] [2019-12-07 20:19:41,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:19:41,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:19:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:19:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:19:41,888 INFO L87 Difference]: Start difference. First operand 21732 states and 68382 transitions. Second operand 6 states. [2019-12-07 20:19:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:19:41,994 INFO L93 Difference]: Finished difference Result 28360 states and 87124 transitions. [2019-12-07 20:19:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:19:41,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 20:19:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:19:41,996 INFO L225 Difference]: With dead ends: 28360 [2019-12-07 20:19:41,996 INFO L226 Difference]: Without dead ends: 2465 [2019-12-07 20:19:41,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:19:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2019-12-07 20:19:42,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2462. [2019-12-07 20:19:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2462 states. [2019-12-07 20:19:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 6857 transitions. [2019-12-07 20:19:42,026 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 6857 transitions. Word has length 70 [2019-12-07 20:19:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:19:42,027 INFO L462 AbstractCegarLoop]: Abstraction has 2462 states and 6857 transitions. [2019-12-07 20:19:42,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:19:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 6857 transitions. [2019-12-07 20:19:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 20:19:42,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:19:42,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:19:42,028 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:19:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:19:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1986817882, now seen corresponding path program 3 times [2019-12-07 20:19:42,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:19:42,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088455723] [2019-12-07 20:19:42,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:19:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:19:42,130 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:19:42,130 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:19:42,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1263] [1263] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse1 (store |v_#valid_68| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_142| 1))) (and (= v_~x$r_buff1_thd0~0_205 0) (= v_~__unbuffered_cnt~0_108 0) (= 0 v_~weak$$choice2~0_82) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 (select (select |v_#memory_int_273| |v_~#x~0.base_142|) |v_~#x~0.offset_142|)) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~x$w_buff0_used~0_1161 0) (= |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0) (= 0 v_~x$r_buff0_thd3~0_136) (= |v_#memory_int_272| (store |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22| (store (select |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22|) |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0))) (= 0 v_~__unbuffered_p0_EAX~0_148) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~y~0_143 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1988~0.base_22|) (= v_~x$r_buff0_thd1~0_232 0) (= v_~main$tmp_guard1~0_28 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (< |v_#StackHeapBarrier_21| |v_~#x~0.base_142|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32 0) (= 0 v_~weak$$choice1~0_86) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$flush_delayed~0_20 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_687) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff1_thd2~0_538) (= v_~__unbuffered_p1_EAX$read_delayed~0_51 0) (= 0 v_~weak$$choice0~0_163) (= 0 v_~x$w_buff0~0_371) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (= v_~x$mem_tmp~0_13 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22|) 0) (= |v_#length_33| (store (store |v_#length_35| |v_~#x~0.base_142| 4) |v_ULTIMATE.start_main_~#t1988~0.base_22| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= 0 v_~x$r_buff0_thd2~0_529) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~x$w_buff1~0_270) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_6 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22| 1)) (= (select .cse1 |v_~#x~0.base_142|) 0) (= v_~x$r_buff0_thd0~0_105 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~main$tmp_guard0~0_38 0) (= 0 |v_~#x~0.offset_142|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_273|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_371, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_136, ~weak$$choice1~0=v_~weak$$choice1~0_86, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_148, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ULTIMATE.start_main_~#t1988~0.base=|v_ULTIMATE.start_main_~#t1988~0.base_22|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32, #length=|v_#length_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6, ~#x~0.offset=|v_~#x~0.offset_142|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_687, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_538, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_81|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_35|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_71|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_163, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_83|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_61|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_17|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_26|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_6, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_51, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_59|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_22|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_32|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_529, ULTIMATE.start_main_~#t1988~0.offset=|v_ULTIMATE.start_main_~#t1988~0.offset_18|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1161, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_42|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_272|, ~#x~0.base=|v_~#x~0.base_142|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_82, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ULTIMATE.start_main_~#t1988~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1990~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_~#t1989~0.base, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ULTIMATE.start_main_~#t1990~0.base, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1988~0.offset, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1989~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 20:19:42,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1204] [1204] L835-1-->L837: Formula: (and (= (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11|) |v_ULTIMATE.start_main_~#t1989~0.offset_10| 1)) |v_#memory_int_191|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1989~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1989~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1989~0.base_11|) (= |v_ULTIMATE.start_main_~#t1989~0.offset_10| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_192|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_191|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_10|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1989~0.offset, ULTIMATE.start_main_~#t1989~0.base] because there is no mapped edge [2019-12-07 20:19:42,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1990~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1990~0.base_13|) (= (store |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13| (store (select |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13|) |v_ULTIMATE.start_main_~#t1990~0.offset_11| 2)) |v_#memory_int_219|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1990~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1990~0.base_13| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_220|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_11|, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_219|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1990~0.offset, ULTIMATE.start_main_~#t1990~0.base, ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:19:42,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L780-->L780-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-427702880 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite34_Out-427702880| |P1Thread1of1ForFork0_#t~ite33_Out-427702880|) (= |P1Thread1of1ForFork0_#t~ite33_Out-427702880| ~x$w_buff1~0_In-427702880) (= 0 (mod ~x$w_buff0_used~0_In-427702880 256)) .cse0) (and (= |P1Thread1of1ForFork0_#t~ite34_Out-427702880| ~x$w_buff1~0_In-427702880) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite33_In-427702880| |P1Thread1of1ForFork0_#t~ite33_Out-427702880|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-427702880, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_In-427702880|, ~weak$$choice2~0=~weak$$choice2~0_In-427702880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427702880} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-427702880, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-427702880|, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-427702880|, ~weak$$choice2~0=~weak$$choice2~0_In-427702880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427702880} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite33, P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 20:19:42,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L783-->L784: Formula: (and (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_6|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:19:42,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L784-->L784-17: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1414990564 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-1414990564| |P1Thread1of1ForFork0_#t~ite54_Out-1414990564|) .cse0 (= ~x$r_buff1_thd2~0_In-1414990564 |P1Thread1of1ForFork0_#t~ite54_Out-1414990564|) (= 0 (mod ~x$w_buff0_used~0_In-1414990564 256))) (and (not .cse0) (= ~x$r_buff1_thd2~0_In-1414990564 |P1Thread1of1ForFork0_#t~ite55_Out-1414990564|) (= |P1Thread1of1ForFork0_#t~ite54_In-1414990564| |P1Thread1of1ForFork0_#t~ite54_Out-1414990564|)))) InVars {P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_In-1414990564|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1414990564, ~weak$$choice2~0=~weak$$choice2~0_In-1414990564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414990564} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1414990564|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1414990564, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1414990564|, ~weak$$choice2~0=~weak$$choice2~0_In-1414990564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414990564} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54, P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 20:19:42,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1146] [1146] L788-->L795: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= v_~y~0_35 1) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= (store |v_#memory_int_99| |v_~#x~0.base_55| (store (select |v_#memory_int_99| |v_~#x~0.base_55|) |v_~#x~0.offset_55| v_~x$mem_tmp~0_7)) |v_#memory_int_98|)) InVars {~#x~0.offset=|v_~#x~0.offset_55|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, #memory_int=|v_#memory_int_99|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~#x~0.offset=|v_~#x~0.offset_55|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_98|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~y~0=v_~y~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 20:19:42,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1151] [1151] L795-2-->L795-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1851184601 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1851184601 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite60_Out1851184601| |P1Thread1of1ForFork0_#t~ite61_Out1851184601|))) (or (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~mem59_In1851184601| |P1Thread1of1ForFork0_#t~mem59_Out1851184601|) (= ~x$w_buff1~0_In1851184601 |P1Thread1of1ForFork0_#t~ite60_Out1851184601|)) (and (or .cse1 .cse2) .cse0 (= |P1Thread1of1ForFork0_#t~mem59_Out1851184601| (select (select |#memory_int_In1851184601| |~#x~0.base_In1851184601|) |~#x~0.offset_In1851184601|)) (= |P1Thread1of1ForFork0_#t~mem59_Out1851184601| |P1Thread1of1ForFork0_#t~ite60_Out1851184601|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1851184601|, ~#x~0.offset=|~#x~0.offset_In1851184601|, ~x$w_buff1~0=~x$w_buff1~0_In1851184601, ~#x~0.base=|~#x~0.base_In1851184601|, #memory_int=|#memory_int_In1851184601|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851184601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1851184601} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1851184601|, ~#x~0.offset=|~#x~0.offset_In1851184601|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1851184601|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1851184601|, ~x$w_buff1~0=~x$w_buff1~0_In1851184601, ~#x~0.base=|~#x~0.base_In1851184601|, #memory_int=|#memory_int_In1851184601|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851184601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1851184601} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 20:19:42,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1153] [1153] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In481089523 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In481089523 256)))) (or (and (= ~x$w_buff0_used~0_In481089523 |P1Thread1of1ForFork0_#t~ite62_Out481089523|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite62_Out481089523|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In481089523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In481089523} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out481089523|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In481089523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In481089523} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 20:19:42,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1390674848 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1390674848 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1390674848 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1390674848 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite63_Out-1390674848| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite63_Out-1390674848| ~x$w_buff1_used~0_In-1390674848)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1390674848, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1390674848, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1390674848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1390674848} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out-1390674848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1390674848, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1390674848, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1390674848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1390674848} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 20:19:42,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2006956485 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-2006956485 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite64_Out-2006956485|) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-2006956485 |P1Thread1of1ForFork0_#t~ite64_Out-2006956485|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2006956485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2006956485} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out-2006956485|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2006956485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2006956485} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 20:19:42,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1738994141 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1738994141 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1738994141 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1738994141 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out1738994141| ~x$r_buff1_thd2~0_In1738994141) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite65_Out1738994141| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1738994141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1738994141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1738994141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1738994141} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out1738994141|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1738994141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1738994141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1738994141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1738994141} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 20:19:42,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~x$r_buff1_thd2~0_410 |v_P1Thread1of1ForFork0_#t~ite65_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_410, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:19:42,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] P0ENTRY-->L4-3: Formula: (and (= v_~y~0_12 v_~__unbuffered_p0_EAX~0_11) (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~x$w_buff0~0_32) (= 1 v_~x$w_buff0_used~0_135) (= v_~x$w_buff0~0_33 v_~x$w_buff1~0_25) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8| v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10) (= v_~x$w_buff1_used~0_72 v_~x$w_buff0_used~0_136) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_135 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_72 256))))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~x$w_buff1~0=v_~x$w_buff1~0_25, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:19:42,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1137223981 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1137223981 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1137223981 |P0Thread1of1ForFork2_#t~ite6_Out-1137223981|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out-1137223981| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1137223981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137223981} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1137223981, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1137223981|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137223981} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 20:19:42,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1505559765 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1505559765 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1505559765 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1505559765 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite7_Out1505559765|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1505559765 |P0Thread1of1ForFork2_#t~ite7_Out1505559765|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1505559765, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1505559765, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1505559765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1505559765} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1505559765, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1505559765|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1505559765, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1505559765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1505559765} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 20:19:42,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1782794872 256))) (.cse0 (= ~x$r_buff0_thd1~0_In-1782794872 ~x$r_buff0_thd1~0_Out-1782794872)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1782794872 256) 0))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd1~0_Out-1782794872 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1782794872, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1782794872} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1782794872, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1782794872|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1782794872} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 20:19:42,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1032125771 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1032125771 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1032125771 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1032125771 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out1032125771| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite9_Out1032125771| ~x$r_buff1_thd1~0_In1032125771)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1032125771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1032125771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1032125771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1032125771} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1032125771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1032125771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1032125771, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1032125771|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1032125771} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 20:19:42,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L763-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_141) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_141, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 20:19:42,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L812-2-->L812-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-1021033594 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1021033594 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite68_Out-1021033594| |P2Thread1of1ForFork1_#t~ite67_Out-1021033594|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~mem66_Out-1021033594| |P2Thread1of1ForFork1_#t~ite67_Out-1021033594|) (= (select (select |#memory_int_In-1021033594| |~#x~0.base_In-1021033594|) |~#x~0.offset_In-1021033594|) |P2Thread1of1ForFork1_#t~mem66_Out-1021033594|) .cse2) (and (= ~x$w_buff1~0_In-1021033594 |P2Thread1of1ForFork1_#t~ite67_Out-1021033594|) (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~mem66_In-1021033594| |P2Thread1of1ForFork1_#t~mem66_Out-1021033594|) .cse2))) InVars {~#x~0.offset=|~#x~0.offset_In-1021033594|, ~x$w_buff1~0=~x$w_buff1~0_In-1021033594, ~#x~0.base=|~#x~0.base_In-1021033594|, #memory_int=|#memory_int_In-1021033594|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1021033594, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1021033594, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In-1021033594|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out-1021033594|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out-1021033594|, ~#x~0.offset=|~#x~0.offset_In-1021033594|, ~x$w_buff1~0=~x$w_buff1~0_In-1021033594, ~#x~0.base=|~#x~0.base_In-1021033594|, #memory_int=|#memory_int_In-1021033594|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1021033594, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1021033594, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out-1021033594|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 20:19:42,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-519854573 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-519854573 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-519854573| ~x$w_buff0_used~0_In-519854573)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-519854573| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519854573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519854573} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-519854573|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519854573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519854573} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 20:19:42,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1315068495 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1315068495 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1315068495 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1315068495 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1315068495 |P2Thread1of1ForFork1_#t~ite70_Out-1315068495|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite70_Out-1315068495|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1315068495, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1315068495, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1315068495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1315068495} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1315068495, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1315068495, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1315068495, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out-1315068495|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1315068495} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 20:19:42,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1835825323 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1835825323 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite71_Out-1835825323|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1835825323 |P2Thread1of1ForFork1_#t~ite71_Out-1835825323|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1835825323, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1835825323} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out-1835825323|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1835825323, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1835825323} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 20:19:42,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-2061871683 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-2061871683 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2061871683 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2061871683 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out-2061871683| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite72_Out-2061871683| ~x$r_buff1_thd3~0_In-2061871683) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2061871683, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2061871683, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2061871683, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2061871683} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2061871683, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2061871683, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2061871683, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-2061871683|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2061871683} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 20:19:42,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L816-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= |v_P2Thread1of1ForFork1_#t~ite72_42| v_~x$r_buff1_thd3~0_167) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 20:19:42,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L843-->L845-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_201 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:19:42,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-800047155 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-800047155 256)))) (or (and (= (select (select |#memory_int_In-800047155| |~#x~0.base_In-800047155|) |~#x~0.offset_In-800047155|) |ULTIMATE.start_main_#t~mem76_Out-800047155|) (= |ULTIMATE.start_main_#t~ite77_Out-800047155| |ULTIMATE.start_main_#t~mem76_Out-800047155|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~mem76_In-800047155| |ULTIMATE.start_main_#t~mem76_Out-800047155|) (not .cse0) (= |ULTIMATE.start_main_#t~ite77_Out-800047155| ~x$w_buff1~0_In-800047155)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-800047155|, ~#x~0.offset=|~#x~0.offset_In-800047155|, ~x$w_buff1~0=~x$w_buff1~0_In-800047155, ~#x~0.base=|~#x~0.base_In-800047155|, #memory_int=|#memory_int_In-800047155|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-800047155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-800047155} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-800047155|, ~#x~0.offset=|~#x~0.offset_In-800047155|, ~x$w_buff1~0=~x$w_buff1~0_In-800047155, ~#x~0.base=|~#x~0.base_In-800047155|, #memory_int=|#memory_int_In-800047155|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-800047155, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-800047155|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-800047155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-07 20:19:42,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L845-4-->L846: Formula: (= (store |v_#memory_int_78| |v_~#x~0.base_46| (store (select |v_#memory_int_78| |v_~#x~0.base_46|) |v_~#x~0.offset_46| |v_ULTIMATE.start_main_#t~ite77_11|)) |v_#memory_int_77|) InVars {~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_11|} OutVars{ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_6|, ~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_77|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_10|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, #memory_int, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 20:19:42,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In869370367 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In869370367 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite79_Out869370367|)) (and (= ~x$w_buff0_used~0_In869370367 |ULTIMATE.start_main_#t~ite79_Out869370367|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In869370367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In869370367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In869370367, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out869370367|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In869370367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 20:19:42,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1150] [1150] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In418320366 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In418320366 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In418320366 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In418320366 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite80_Out418320366| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite80_Out418320366| ~x$w_buff1_used~0_In418320366)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418320366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418320366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418320366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418320366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418320366, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out418320366|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418320366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418320366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418320366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 20:19:42,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1032921614 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1032921614 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite81_Out-1032921614| ~x$r_buff0_thd0~0_In-1032921614) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite81_Out-1032921614| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1032921614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1032921614} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1032921614, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-1032921614|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1032921614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 20:19:42,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In410845581 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In410845581 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In410845581 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In410845581 256)))) (or (and (= |ULTIMATE.start_main_#t~ite82_Out410845581| ~x$r_buff1_thd0~0_In410845581) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite82_Out410845581|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In410845581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In410845581, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In410845581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410845581} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In410845581, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out410845581|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In410845581, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In410845581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410845581} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 20:19:42,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L853-->L853-3: Formula: (let ((.cse1 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In600451289 256) 0))) (.cse0 (= (mod ~weak$$choice1~0_In600451289 256) 0))) (or (and .cse0 .cse1 (= ~__unbuffered_p1_EAX~0_In600451289 |ULTIMATE.start_main_#t~ite85_Out600451289|) (= |ULTIMATE.start_main_#t~mem84_In600451289| |ULTIMATE.start_main_#t~mem84_Out600451289|)) (and (= |ULTIMATE.start_main_#t~mem84_Out600451289| (select (select |#memory_int_In600451289| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In600451289) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In600451289)) .cse1 (not .cse0) (= |ULTIMATE.start_main_#t~mem84_Out600451289| |ULTIMATE.start_main_#t~ite85_Out600451289|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In600451289, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In600451289, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In600451289, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In600451289, #memory_int=|#memory_int_In600451289|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In600451289, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In600451289|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out600451289|, ~weak$$choice1~0=~weak$$choice1~0_In600451289, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In600451289, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In600451289, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In600451289, #memory_int=|#memory_int_In600451289|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out600451289|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In600451289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 20:19:42,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1205] [1205] L853-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_15 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_15 1)) (.cse3 (= 1 v_~__unbuffered_p1_EAX~0_32)) (.cse0 (= |v_ULTIMATE.start_main_#t~ite85_26| v_~__unbuffered_p1_EAX~0_32)) (.cse4 (= 2 v_~__unbuffered_p0_EAX~0_62)) (.cse1 (= v_~y~0_65 2))) (or (and .cse0 (not .cse1) .cse2) (and (not .cse3) .cse0 .cse2) (and (not .cse4) .cse0 .cse2) (and (= v_~main$tmp_guard1~0_15 0) .cse3 .cse0 .cse4 .cse1)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_26|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~y~0=v_~y~0_65} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y~0=v_~y~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 20:19:42,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1202] [1202] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 20:19:42,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:19:42 BasicIcfg [2019-12-07 20:19:42,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:19:42,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:19:42,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:19:42,208 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:19:42,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:13:48" (3/4) ... [2019-12-07 20:19:42,210 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:19:42,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1263] [1263] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse1 (store |v_#valid_68| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_142| 1))) (and (= v_~x$r_buff1_thd0~0_205 0) (= v_~__unbuffered_cnt~0_108 0) (= 0 v_~weak$$choice2~0_82) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7 0) (= 0 (select (select |v_#memory_int_273| |v_~#x~0.base_142|) |v_~#x~0.offset_142|)) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~x$w_buff0_used~0_1161 0) (= |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0) (= 0 v_~x$r_buff0_thd3~0_136) (= |v_#memory_int_272| (store |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22| (store (select |v_#memory_int_273| |v_ULTIMATE.start_main_~#t1988~0.base_22|) |v_ULTIMATE.start_main_~#t1988~0.offset_18| 0))) (= 0 v_~__unbuffered_p0_EAX~0_148) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~y~0_143 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1988~0.base_22|) (= v_~x$r_buff0_thd1~0_232 0) (= v_~main$tmp_guard1~0_28 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_7 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (< |v_#StackHeapBarrier_21| |v_~#x~0.base_142|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32 0) (= 0 v_~weak$$choice1~0_86) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$flush_delayed~0_20 0) (= 0 v_~x$r_buff1_thd3~0_209) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_687) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff1_thd2~0_538) (= v_~__unbuffered_p1_EAX$read_delayed~0_51 0) (= 0 v_~weak$$choice0~0_163) (= 0 v_~x$w_buff0~0_371) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_7) (= v_~x$mem_tmp~0_13 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22|) 0) (= |v_#length_33| (store (store |v_#length_35| |v_~#x~0.base_142| 4) |v_ULTIMATE.start_main_~#t1988~0.base_22| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7 0) (= 0 v_~x$r_buff0_thd2~0_529) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~x$w_buff1~0_270) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_6 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t1988~0.base_22| 1)) (= (select .cse1 |v_~#x~0.base_142|) 0) (= v_~x$r_buff0_thd0~0_105 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~main$tmp_guard0~0_38 0) (= 0 |v_~#x~0.offset_142|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_273|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_371, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_7, ~x$flush_delayed~0=v_~x$flush_delayed~0_20, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_136, ~weak$$choice1~0=v_~weak$$choice1~0_86, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_148, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ULTIMATE.start_main_~#t1988~0.base=|v_ULTIMATE.start_main_~#t1988~0.base_22|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_32, #length=|v_#length_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_6, ~#x~0.offset=|v_~#x~0.offset_142|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_687, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_538, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_81|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_35|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_71|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_163, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_83|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_61|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_17|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_26|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_6, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_232, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_51, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_59|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_22|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_7, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_21|, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_7, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_32|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_529, ULTIMATE.start_main_~#t1988~0.offset=|v_ULTIMATE.start_main_~#t1988~0.offset_18|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1161, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_42|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_272|, ~#x~0.base=|v_~#x~0.base_142|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_82, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ULTIMATE.start_main_~#t1988~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1990~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_~#t1989~0.base, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ULTIMATE.start_main_~#t1990~0.base, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1988~0.offset, ULTIMATE.start_main_#t~ite78, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1989~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 20:19:42,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1204] [1204] L835-1-->L837: Formula: (and (= (store |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11| (store (select |v_#memory_int_192| |v_ULTIMATE.start_main_~#t1989~0.base_11|) |v_ULTIMATE.start_main_~#t1989~0.offset_10| 1)) |v_#memory_int_191|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1989~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1989~0.base_11| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1989~0.base_11|) (= |v_ULTIMATE.start_main_~#t1989~0.offset_10| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1989~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_192|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_191|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1989~0.offset=|v_ULTIMATE.start_main_~#t1989~0.offset_10|, ULTIMATE.start_main_~#t1989~0.base=|v_ULTIMATE.start_main_~#t1989~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1989~0.offset, ULTIMATE.start_main_~#t1989~0.base] because there is no mapped edge [2019-12-07 20:19:42,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1990~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1990~0.base_13|) (= (store |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13| (store (select |v_#memory_int_220| |v_ULTIMATE.start_main_~#t1990~0.base_13|) |v_ULTIMATE.start_main_~#t1990~0.offset_11| 2)) |v_#memory_int_219|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1990~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1990~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1990~0.base_13| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_220|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1990~0.offset=|v_ULTIMATE.start_main_~#t1990~0.offset_11|, ULTIMATE.start_main_~#t1990~0.base=|v_ULTIMATE.start_main_~#t1990~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_219|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1990~0.offset, ULTIMATE.start_main_~#t1990~0.base, ULTIMATE.start_main_#t~nondet74, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:19:42,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L780-->L780-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-427702880 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite34_Out-427702880| |P1Thread1of1ForFork0_#t~ite33_Out-427702880|) (= |P1Thread1of1ForFork0_#t~ite33_Out-427702880| ~x$w_buff1~0_In-427702880) (= 0 (mod ~x$w_buff0_used~0_In-427702880 256)) .cse0) (and (= |P1Thread1of1ForFork0_#t~ite34_Out-427702880| ~x$w_buff1~0_In-427702880) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite33_In-427702880| |P1Thread1of1ForFork0_#t~ite33_Out-427702880|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-427702880, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_In-427702880|, ~weak$$choice2~0=~weak$$choice2~0_In-427702880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427702880} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-427702880, P1Thread1of1ForFork0_#t~ite33=|P1Thread1of1ForFork0_#t~ite33_Out-427702880|, P1Thread1of1ForFork0_#t~ite34=|P1Thread1of1ForFork0_#t~ite34_Out-427702880|, ~weak$$choice2~0=~weak$$choice2~0_In-427702880, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-427702880} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite33, P1Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 20:19:42,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L783-->L784: Formula: (and (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_6|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:19:42,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L784-->L784-17: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1414990564 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite55_Out-1414990564| |P1Thread1of1ForFork0_#t~ite54_Out-1414990564|) .cse0 (= ~x$r_buff1_thd2~0_In-1414990564 |P1Thread1of1ForFork0_#t~ite54_Out-1414990564|) (= 0 (mod ~x$w_buff0_used~0_In-1414990564 256))) (and (not .cse0) (= ~x$r_buff1_thd2~0_In-1414990564 |P1Thread1of1ForFork0_#t~ite55_Out-1414990564|) (= |P1Thread1of1ForFork0_#t~ite54_In-1414990564| |P1Thread1of1ForFork0_#t~ite54_Out-1414990564|)))) InVars {P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_In-1414990564|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1414990564, ~weak$$choice2~0=~weak$$choice2~0_In-1414990564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414990564} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1414990564|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1414990564, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1414990564|, ~weak$$choice2~0=~weak$$choice2~0_In-1414990564, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1414990564} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54, P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 20:19:42,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1146] [1146] L788-->L795: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= v_~y~0_35 1) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= (store |v_#memory_int_99| |v_~#x~0.base_55| (store (select |v_#memory_int_99| |v_~#x~0.base_55|) |v_~#x~0.offset_55| v_~x$mem_tmp~0_7)) |v_#memory_int_98|)) InVars {~#x~0.offset=|v_~#x~0.offset_55|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, #memory_int=|v_#memory_int_99|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~#x~0.offset=|v_~#x~0.offset_55|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_98|, ~#x~0.base=|v_~#x~0.base_55|, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~y~0=v_~y~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 20:19:42,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1151] [1151] L795-2-->L795-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1851184601 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1851184601 256) 0)) (.cse0 (= |P1Thread1of1ForFork0_#t~ite60_Out1851184601| |P1Thread1of1ForFork0_#t~ite61_Out1851184601|))) (or (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~mem59_In1851184601| |P1Thread1of1ForFork0_#t~mem59_Out1851184601|) (= ~x$w_buff1~0_In1851184601 |P1Thread1of1ForFork0_#t~ite60_Out1851184601|)) (and (or .cse1 .cse2) .cse0 (= |P1Thread1of1ForFork0_#t~mem59_Out1851184601| (select (select |#memory_int_In1851184601| |~#x~0.base_In1851184601|) |~#x~0.offset_In1851184601|)) (= |P1Thread1of1ForFork0_#t~mem59_Out1851184601| |P1Thread1of1ForFork0_#t~ite60_Out1851184601|)))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1851184601|, ~#x~0.offset=|~#x~0.offset_In1851184601|, ~x$w_buff1~0=~x$w_buff1~0_In1851184601, ~#x~0.base=|~#x~0.base_In1851184601|, #memory_int=|#memory_int_In1851184601|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851184601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1851184601} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1851184601|, ~#x~0.offset=|~#x~0.offset_In1851184601|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1851184601|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1851184601|, ~x$w_buff1~0=~x$w_buff1~0_In1851184601, ~#x~0.base=|~#x~0.base_In1851184601|, #memory_int=|#memory_int_In1851184601|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1851184601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1851184601} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 20:19:42,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1153] [1153] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In481089523 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In481089523 256)))) (or (and (= ~x$w_buff0_used~0_In481089523 |P1Thread1of1ForFork0_#t~ite62_Out481089523|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite62_Out481089523|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In481089523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In481089523} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out481089523|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In481089523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In481089523} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 20:19:42,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1390674848 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1390674848 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1390674848 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1390674848 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite63_Out-1390674848| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite63_Out-1390674848| ~x$w_buff1_used~0_In-1390674848)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1390674848, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1390674848, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1390674848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1390674848} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out-1390674848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1390674848, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1390674848, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1390674848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1390674848} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 20:19:42,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2006956485 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-2006956485 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite64_Out-2006956485|) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-2006956485 |P1Thread1of1ForFork0_#t~ite64_Out-2006956485|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2006956485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2006956485} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out-2006956485|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2006956485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2006956485} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 20:19:42,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1177] [1177] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1738994141 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1738994141 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1738994141 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1738994141 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out1738994141| ~x$r_buff1_thd2~0_In1738994141) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite65_Out1738994141| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1738994141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1738994141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1738994141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1738994141} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out1738994141|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1738994141, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1738994141, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1738994141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1738994141} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 20:19:42,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= v_~x$r_buff1_thd2~0_410 |v_P1Thread1of1ForFork0_#t~ite65_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_410, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 20:19:42,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1058] [1058] P0ENTRY-->L4-3: Formula: (and (= v_~y~0_12 v_~__unbuffered_p0_EAX~0_11) (= v_P0Thread1of1ForFork2_~arg.base_8 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~x$w_buff0~0_32) (= 1 v_~x$w_buff0_used~0_135) (= v_~x$w_buff0~0_33 v_~x$w_buff1~0_25) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8| v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10) (= v_~x$w_buff1_used~0_72 v_~x$w_buff0_used~0_136) (= v_P0Thread1of1ForFork2_~arg.offset_8 |v_P0Thread1of1ForFork2_#in~arg.offset_10|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_135 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_72 256))))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~x$w_buff1~0=v_~x$w_buff1~0_25, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~y~0=v_~y~0_12, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:19:42,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1137223981 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1137223981 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1137223981 |P0Thread1of1ForFork2_#t~ite6_Out-1137223981|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out-1137223981| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1137223981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137223981} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1137223981, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1137223981|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1137223981} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 20:19:42,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1505559765 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1505559765 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1505559765 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1505559765 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork2_#t~ite7_Out1505559765|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1505559765 |P0Thread1of1ForFork2_#t~ite7_Out1505559765|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1505559765, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1505559765, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1505559765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1505559765} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1505559765, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1505559765|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1505559765, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1505559765, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1505559765} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 20:19:42,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1782794872 256))) (.cse0 (= ~x$r_buff0_thd1~0_In-1782794872 ~x$r_buff0_thd1~0_Out-1782794872)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1782794872 256) 0))) (or (and .cse0 .cse1) (and (= ~x$r_buff0_thd1~0_Out-1782794872 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1782794872, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1782794872} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1782794872, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1782794872|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1782794872} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 20:19:42,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1032125771 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1032125771 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1032125771 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1032125771 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out1032125771| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite9_Out1032125771| ~x$r_buff1_thd1~0_In1032125771)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1032125771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1032125771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1032125771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1032125771} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1032125771, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1032125771, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1032125771, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1032125771|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1032125771} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 20:19:42,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L763-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_141) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_141, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 20:19:42,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L812-2-->L812-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-1021033594 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1021033594 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite68_Out-1021033594| |P2Thread1of1ForFork1_#t~ite67_Out-1021033594|))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~mem66_Out-1021033594| |P2Thread1of1ForFork1_#t~ite67_Out-1021033594|) (= (select (select |#memory_int_In-1021033594| |~#x~0.base_In-1021033594|) |~#x~0.offset_In-1021033594|) |P2Thread1of1ForFork1_#t~mem66_Out-1021033594|) .cse2) (and (= ~x$w_buff1~0_In-1021033594 |P2Thread1of1ForFork1_#t~ite67_Out-1021033594|) (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~mem66_In-1021033594| |P2Thread1of1ForFork1_#t~mem66_Out-1021033594|) .cse2))) InVars {~#x~0.offset=|~#x~0.offset_In-1021033594|, ~x$w_buff1~0=~x$w_buff1~0_In-1021033594, ~#x~0.base=|~#x~0.base_In-1021033594|, #memory_int=|#memory_int_In-1021033594|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1021033594, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1021033594, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In-1021033594|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out-1021033594|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out-1021033594|, ~#x~0.offset=|~#x~0.offset_In-1021033594|, ~x$w_buff1~0=~x$w_buff1~0_In-1021033594, ~#x~0.base=|~#x~0.base_In-1021033594|, #memory_int=|#memory_int_In-1021033594|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1021033594, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1021033594, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out-1021033594|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 20:19:42,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-519854573 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-519854573 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-519854573| ~x$w_buff0_used~0_In-519854573)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-519854573| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519854573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519854573} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-519854573|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-519854573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-519854573} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 20:19:42,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1315068495 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1315068495 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1315068495 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1315068495 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1315068495 |P2Thread1of1ForFork1_#t~ite70_Out-1315068495|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite70_Out-1315068495|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1315068495, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1315068495, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1315068495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1315068495} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1315068495, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1315068495, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1315068495, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out-1315068495|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1315068495} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 20:19:42,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1835825323 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1835825323 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite71_Out-1835825323|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1835825323 |P2Thread1of1ForFork1_#t~ite71_Out-1835825323|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1835825323, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1835825323} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out-1835825323|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1835825323, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1835825323} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 20:19:42,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-2061871683 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-2061871683 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2061871683 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2061871683 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out-2061871683| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite72_Out-2061871683| ~x$r_buff1_thd3~0_In-2061871683) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2061871683, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2061871683, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2061871683, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2061871683} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2061871683, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2061871683, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2061871683, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out-2061871683|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2061871683} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 20:19:42,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L816-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= |v_P2Thread1of1ForFork1_#t~ite72_42| v_~x$r_buff1_thd3~0_167) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_42|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_41|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 20:19:42,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L843-->L845-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_201 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:19:42,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-800047155 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-800047155 256)))) (or (and (= (select (select |#memory_int_In-800047155| |~#x~0.base_In-800047155|) |~#x~0.offset_In-800047155|) |ULTIMATE.start_main_#t~mem76_Out-800047155|) (= |ULTIMATE.start_main_#t~ite77_Out-800047155| |ULTIMATE.start_main_#t~mem76_Out-800047155|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~mem76_In-800047155| |ULTIMATE.start_main_#t~mem76_Out-800047155|) (not .cse0) (= |ULTIMATE.start_main_#t~ite77_Out-800047155| ~x$w_buff1~0_In-800047155)))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-800047155|, ~#x~0.offset=|~#x~0.offset_In-800047155|, ~x$w_buff1~0=~x$w_buff1~0_In-800047155, ~#x~0.base=|~#x~0.base_In-800047155|, #memory_int=|#memory_int_In-800047155|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-800047155, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-800047155} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-800047155|, ~#x~0.offset=|~#x~0.offset_In-800047155|, ~x$w_buff1~0=~x$w_buff1~0_In-800047155, ~#x~0.base=|~#x~0.base_In-800047155|, #memory_int=|#memory_int_In-800047155|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-800047155, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-800047155|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-800047155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-07 20:19:42,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L845-4-->L846: Formula: (= (store |v_#memory_int_78| |v_~#x~0.base_46| (store (select |v_#memory_int_78| |v_~#x~0.base_46|) |v_~#x~0.offset_46| |v_ULTIMATE.start_main_#t~ite77_11|)) |v_#memory_int_77|) InVars {~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_78|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_11|} OutVars{ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_6|, ~#x~0.offset=|v_~#x~0.offset_46|, #memory_int=|v_#memory_int_77|, ~#x~0.base=|v_~#x~0.base_46|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_10|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, #memory_int, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 20:19:42,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In869370367 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In869370367 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite79_Out869370367|)) (and (= ~x$w_buff0_used~0_In869370367 |ULTIMATE.start_main_#t~ite79_Out869370367|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In869370367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In869370367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In869370367, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out869370367|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In869370367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 20:19:42,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1150] [1150] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In418320366 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In418320366 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In418320366 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In418320366 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite80_Out418320366| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite80_Out418320366| ~x$w_buff1_used~0_In418320366)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418320366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418320366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418320366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418320366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418320366, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out418320366|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418320366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418320366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418320366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 20:19:42,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1032921614 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1032921614 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite81_Out-1032921614| ~x$r_buff0_thd0~0_In-1032921614) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite81_Out-1032921614| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1032921614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1032921614} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1032921614, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-1032921614|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1032921614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 20:19:42,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In410845581 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In410845581 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In410845581 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In410845581 256)))) (or (and (= |ULTIMATE.start_main_#t~ite82_Out410845581| ~x$r_buff1_thd0~0_In410845581) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite82_Out410845581|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In410845581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In410845581, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In410845581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410845581} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In410845581, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out410845581|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In410845581, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In410845581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In410845581} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 20:19:42,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L853-->L853-3: Formula: (let ((.cse1 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In600451289 256) 0))) (.cse0 (= (mod ~weak$$choice1~0_In600451289 256) 0))) (or (and .cse0 .cse1 (= ~__unbuffered_p1_EAX~0_In600451289 |ULTIMATE.start_main_#t~ite85_Out600451289|) (= |ULTIMATE.start_main_#t~mem84_In600451289| |ULTIMATE.start_main_#t~mem84_Out600451289|)) (and (= |ULTIMATE.start_main_#t~mem84_Out600451289| (select (select |#memory_int_In600451289| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In600451289) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In600451289)) .cse1 (not .cse0) (= |ULTIMATE.start_main_#t~mem84_Out600451289| |ULTIMATE.start_main_#t~ite85_Out600451289|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In600451289, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In600451289, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In600451289, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In600451289, #memory_int=|#memory_int_In600451289|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In600451289, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In600451289|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out600451289|, ~weak$$choice1~0=~weak$$choice1~0_In600451289, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In600451289, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In600451289, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In600451289, #memory_int=|#memory_int_In600451289|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out600451289|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In600451289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 20:19:42,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1205] [1205] L853-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_15 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_15 1)) (.cse3 (= 1 v_~__unbuffered_p1_EAX~0_32)) (.cse0 (= |v_ULTIMATE.start_main_#t~ite85_26| v_~__unbuffered_p1_EAX~0_32)) (.cse4 (= 2 v_~__unbuffered_p0_EAX~0_62)) (.cse1 (= v_~y~0_65 2))) (or (and .cse0 (not .cse1) .cse2) (and (not .cse3) .cse0 .cse2) (and (not .cse4) .cse0 .cse2) (and (= v_~main$tmp_guard1~0_15 0) .cse3 .cse0 .cse4 .cse1)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_26|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~y~0=v_~y~0_65} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y~0=v_~y~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_28|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 20:19:42,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1202] [1202] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 20:19:42,286 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9975292c-df5a-48e2-adce-10f6c7e8b25b/bin/utaipan/witness.graphml [2019-12-07 20:19:42,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:19:42,287 INFO L168 Benchmark]: Toolchain (without parser) took 354378.30 ms. Allocated memory was 1.0 GB in the beginning and 8.9 GB in the end (delta: 7.9 GB). Free memory was 937.1 MB in the beginning and 6.5 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 20:19:42,287 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:19:42,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:42,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:19:42,288 INFO L168 Benchmark]: Boogie Preprocessor took 29.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:42,288 INFO L168 Benchmark]: RCFGBuilder took 485.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.4 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:42,288 INFO L168 Benchmark]: TraceAbstraction took 353343.03 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 990.4 MB in the beginning and 6.5 GB in the end (delta: -5.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 20:19:42,289 INFO L168 Benchmark]: Witness Printer took 78.38 ms. Allocated memory is still 8.9 GB. Free memory was 6.5 GB in the beginning and 6.5 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:19:42,290 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 485.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.4 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 353343.03 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 990.4 MB in the beginning and 6.5 GB in the end (delta: -5.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 78.38 ms. Allocated memory is still 8.9 GB. Free memory was 6.5 GB in the beginning and 6.5 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 234 ProgramPointsBefore, 117 ProgramPointsAfterwards, 292 TransitionsBefore, 144 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 72 ConcurrentYvCompositions, 35 ChoiceCompositions, 11616 VarBasedMoverChecksPositive, 324 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 168479 CheckedPairsTotal, 179 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L837] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 x$flush_delayed = weak$$choice2 [L776] EXPR 2 \read(x) [L776] 2 x$mem_tmp = x [L777] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L778] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L778] EXPR 2 \read(x) [L778] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) VAL [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L778] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L779] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L839] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L780] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L781] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L782] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L782] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L784] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L785] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L786] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L787] EXPR 2 \read(x) [L787] 2 __unbuffered_p1_EAX = x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L809] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L752] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L759] 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) [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 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 [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=3, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 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 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 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 [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 353.1s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 90.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7145 SDtfs, 9062 SDslu, 14279 SDs, 0 SdLazy, 9241 SolverSat, 562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 53 SyntacticMatches, 18 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470095occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 216.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 970235 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1031 ConstructedInterpolants, 0 QuantifiedInterpolants, 147812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...