./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/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 72819179e4b32e9766c3a41334d2b2772314b032 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:08:29,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:08:29,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:08:29,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:08:29,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:08:29,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:08:29,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:08:29,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:08:29,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:08:29,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:08:29,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:08:29,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:08:29,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:08:29,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:08:29,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:08:29,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:08:29,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:08:29,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:08:29,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:08:29,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:08:29,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:08:29,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:08:29,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:08:29,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:08:29,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:08:29,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:08:29,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:08:29,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:08:29,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:08:29,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:08:29,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:08:29,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:08:29,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:08:29,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:08:29,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:08:29,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:08:29,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:08:29,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:08:29,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:08:29,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:08:29,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:08:29,385 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:08:29,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:08:29,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:08:29,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:08:29,396 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:08:29,396 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:08:29,396 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:08:29,396 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:08:29,397 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:08:29,397 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:08:29,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:08:29,398 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:08:29,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:08:29,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:08:29,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:08:29,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:08:29,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:08:29,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:08:29,400 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:08:29,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:08:29,401 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_86d1b80e-efbf-415a-b8ab-f5ca34620f34/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 -> 72819179e4b32e9766c3a41334d2b2772314b032 [2019-12-07 19:08:29,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:08:29,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:08:29,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:08:29,513 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:08:29,514 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:08:29,514 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2019-12-07 19:08:29,558 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/data/47764be86/61d0216501b4479f93366c43f46c2faf/FLAGca0db47ad [2019-12-07 19:08:29,923 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:08:29,923 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2019-12-07 19:08:29,933 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/data/47764be86/61d0216501b4479f93366c43f46c2faf/FLAGca0db47ad [2019-12-07 19:08:29,944 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/data/47764be86/61d0216501b4479f93366c43f46c2faf [2019-12-07 19:08:29,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:08:29,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:08:29,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:08:29,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:08:29,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:08:29,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:08:29" (1/1) ... [2019-12-07 19:08:29,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:29, skipping insertion in model container [2019-12-07 19:08:29,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:08:29" (1/1) ... [2019-12-07 19:08:29,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:08:29,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:08:30,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:08:30,278 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:08:30,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:08:30,363 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:08:30,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30 WrapperNode [2019-12-07 19:08:30,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:08:30,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:08:30,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:08:30,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:08:30,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:08:30,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:08:30,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:08:30,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:08:30,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... [2019-12-07 19:08:30,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:08:30,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:08:30,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:08:30,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:08:30,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/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 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:08:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:08:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:08:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:08:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:08:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:08:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:08:30,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:08:30,471 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 19:08:30,832 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:08:30,833 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:08:30,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:08:30 BoogieIcfgContainer [2019-12-07 19:08:30,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:08:30,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:08:30,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:08:30,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:08:30,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:08:29" (1/3) ... [2019-12-07 19:08:30,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3823441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:08:30, skipping insertion in model container [2019-12-07 19:08:30,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:08:30" (2/3) ... [2019-12-07 19:08:30,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3823441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:08:30, skipping insertion in model container [2019-12-07 19:08:30,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:08:30" (3/3) ... [2019-12-07 19:08:30,838 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2019-12-07 19:08:30,844 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:08:30,845 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:08:30,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:08:30,850 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:08:30,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,873 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,873 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,873 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,877 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:08:30,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:08:30,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:08:30,907 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:08:30,907 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:08:30,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:08:30,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:08:30,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:08:30,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:08:30,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:08:30,918 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-07 19:08:30,920 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 19:08:30,973 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 19:08:30,973 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:08:30,983 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 573 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:08:30,998 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 19:08:31,027 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 19:08:31,028 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:08:31,033 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 573 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 19:08:31,048 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-07 19:08:31,049 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:08:33,998 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:08:34,091 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-07 19:08:34,092 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 19:08:34,094 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-07 19:08:46,274 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-07 19:08:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-07 19:08:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:08:46,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:08:46,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:08:46,280 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 19:08:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:08:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-07 19:08:46,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:08:46,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687000875] [2019-12-07 19:08:46,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:08:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:08:46,424 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 19:08:46,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687000875] [2019-12-07 19:08:46,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:08:46,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:08:46,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499321504] [2019-12-07 19:08:46,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:08:46,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:08:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:08:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:08:46,439 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-07 19:08:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:08:47,122 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-07 19:08:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:08:47,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:08:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:08:47,814 INFO L225 Difference]: With dead ends: 104560 [2019-12-07 19:08:47,814 INFO L226 Difference]: Without dead ends: 102376 [2019-12-07 19:08:47,815 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 19:08:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-07 19:08:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-07 19:08:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-07 19:08:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-07 19:08:52,609 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-07 19:08:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:08:52,610 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-07 19:08:52,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:08:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-07 19:08:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:08:52,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:08:52,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:08:52,615 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 19:08:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:08:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-07 19:08:52,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:08:52,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332782112] [2019-12-07 19:08:52,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:08:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:08:52,686 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 19:08:52,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332782112] [2019-12-07 19:08:52,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:08:52,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:08:52,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479405328] [2019-12-07 19:08:52,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:08:52,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:08:52,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:08:52,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:08:52,688 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-07 19:08:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:08:55,355 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-07 19:08:55,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:08:55,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:08:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:08:55,769 INFO L225 Difference]: With dead ends: 164490 [2019-12-07 19:08:55,770 INFO L226 Difference]: Without dead ends: 164441 [2019-12-07 19:08:55,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:08:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-07 19:09:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-07 19:09:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-07 19:09:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-07 19:09:02,341 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-07 19:09:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:02,341 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-07 19:09:02,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-07 19:09:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:09:02,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:02,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:02,345 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 19:09:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-07 19:09:02,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:02,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821749997] [2019-12-07 19:09:02,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:02,403 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 19:09:02,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821749997] [2019-12-07 19:09:02,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:02,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:02,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12899673] [2019-12-07 19:09:02,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:02,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:02,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:02,405 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-07 19:09:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:03,810 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-07 19:09:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:03,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:09:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:04,348 INFO L225 Difference]: With dead ends: 211896 [2019-12-07 19:09:04,348 INFO L226 Difference]: Without dead ends: 211833 [2019-12-07 19:09:04,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-07 19:09:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-07 19:09:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-07 19:09:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-07 19:09:14,036 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-07 19:09:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:14,036 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-07 19:09:14,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-07 19:09:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:09:14,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:14,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:14,039 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 19:09:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:14,039 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-07 19:09:14,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:14,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309198458] [2019-12-07 19:09:14,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:14,076 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 19:09:14,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309198458] [2019-12-07 19:09:14,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:14,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:14,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538315214] [2019-12-07 19:09:14,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:14,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:14,077 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-07 19:09:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:14,181 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-07 19:09:14,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:14,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 19:09:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:14,234 INFO L225 Difference]: With dead ends: 36088 [2019-12-07 19:09:14,234 INFO L226 Difference]: Without dead ends: 36088 [2019-12-07 19:09:14,234 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 19:09:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-07 19:09:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-07 19:09:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-07 19:09:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-07 19:09:14,816 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-07 19:09:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:14,816 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-07 19:09:14,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-07 19:09:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:09:14,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:14,819 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 19:09:14,819 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 19:09:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-07 19:09:14,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:14,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759200898] [2019-12-07 19:09:14,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:14,883 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 19:09:14,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759200898] [2019-12-07 19:09:14,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:14,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:14,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363007249] [2019-12-07 19:09:14,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:09:14,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:09:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:14,885 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 6 states. [2019-12-07 19:09:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:15,537 INFO L93 Difference]: Finished difference Result 50098 states and 158333 transitions. [2019-12-07 19:09:15,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:09:15,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 19:09:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:15,609 INFO L225 Difference]: With dead ends: 50098 [2019-12-07 19:09:15,609 INFO L226 Difference]: Without dead ends: 50091 [2019-12-07 19:09:15,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:09:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50091 states. [2019-12-07 19:09:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50091 to 36331. [2019-12-07 19:09:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36331 states. [2019-12-07 19:09:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36331 states to 36331 states and 118099 transitions. [2019-12-07 19:09:16,663 INFO L78 Accepts]: Start accepts. Automaton has 36331 states and 118099 transitions. Word has length 19 [2019-12-07 19:09:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:16,664 INFO L462 AbstractCegarLoop]: Abstraction has 36331 states and 118099 transitions. [2019-12-07 19:09:16,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:09:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 36331 states and 118099 transitions. [2019-12-07 19:09:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:09:16,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:16,667 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 19:09:16,667 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 19:09:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1843003519, now seen corresponding path program 2 times [2019-12-07 19:09:16,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:16,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574544782] [2019-12-07 19:09:16,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:16,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 19:09:16,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574544782] [2019-12-07 19:09:16,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:16,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:16,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337882279] [2019-12-07 19:09:16,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:16,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:16,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:16,727 INFO L87 Difference]: Start difference. First operand 36331 states and 118099 transitions. Second operand 5 states. [2019-12-07 19:09:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:17,198 INFO L93 Difference]: Finished difference Result 46087 states and 147024 transitions. [2019-12-07 19:09:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:09:17,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 19:09:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:17,260 INFO L225 Difference]: With dead ends: 46087 [2019-12-07 19:09:17,260 INFO L226 Difference]: Without dead ends: 46080 [2019-12-07 19:09:17,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 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 19:09:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46080 states. [2019-12-07 19:09:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46080 to 36431. [2019-12-07 19:09:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-07 19:09:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-07 19:09:17,918 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-07 19:09:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:17,919 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-07 19:09:17,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-07 19:09:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:09:17,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:17,926 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 19:09:17,926 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 19:09:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-07 19:09:17,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:17,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253739327] [2019-12-07 19:09:17,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:17,961 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 19:09:17,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253739327] [2019-12-07 19:09:17,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:17,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:17,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567135415] [2019-12-07 19:09:17,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:09:17,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:17,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:09:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:17,963 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-07 19:09:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:17,989 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-07 19:09:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:09:17,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 19:09:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:17,995 INFO L225 Difference]: With dead ends: 7050 [2019-12-07 19:09:17,995 INFO L226 Difference]: Without dead ends: 7050 [2019-12-07 19:09:17,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:09:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-07 19:09:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-07 19:09:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-07 19:09:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-07 19:09:18,074 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-07 19:09:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:18,074 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-07 19:09:18,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:09:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-07 19:09:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 19:09:18,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:18,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:18,081 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 19:09:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-07 19:09:18,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:18,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466221422] [2019-12-07 19:09:18,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:18,125 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 19:09:18,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466221422] [2019-12-07 19:09:18,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:18,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:09:18,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041037649] [2019-12-07 19:09:18,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:18,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:18,127 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-07 19:09:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:18,159 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-07 19:09:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:09:18,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 19:09:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:18,164 INFO L225 Difference]: With dead ends: 5023 [2019-12-07 19:09:18,165 INFO L226 Difference]: Without dead ends: 5023 [2019-12-07 19:09:18,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-07 19:09:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-07 19:09:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-07 19:09:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-07 19:09:18,224 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-07 19:09:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:18,225 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-07 19:09:18,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-07 19:09:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:09:18,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:18,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:18,231 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 19:09:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-07 19:09:18,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:18,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904031365] [2019-12-07 19:09:18,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:18,273 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 19:09:18,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904031365] [2019-12-07 19:09:18,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:18,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:18,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70194659] [2019-12-07 19:09:18,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:18,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:18,274 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-07 19:09:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:18,317 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-07 19:09:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:18,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 19:09:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:18,322 INFO L225 Difference]: With dead ends: 4668 [2019-12-07 19:09:18,322 INFO L226 Difference]: Without dead ends: 4668 [2019-12-07 19:09:18,322 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 19:09:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-07 19:09:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-07 19:09:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-07 19:09:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-07 19:09:18,379 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-07 19:09:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:18,380 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-07 19:09:18,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-07 19:09:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:09:18,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:18,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:18,385 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 19:09:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-07 19:09:18,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:18,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845803038] [2019-12-07 19:09:18,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:18,435 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 19:09:18,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845803038] [2019-12-07 19:09:18,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:18,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:09:18,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058780143] [2019-12-07 19:09:18,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:18,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:18,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:18,437 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-07 19:09:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:18,476 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-07 19:09:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:18,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 19:09:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:18,480 INFO L225 Difference]: With dead ends: 4668 [2019-12-07 19:09:18,480 INFO L226 Difference]: Without dead ends: 4668 [2019-12-07 19:09:18,481 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 19:09:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-07 19:09:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-07 19:09:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-07 19:09:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-07 19:09:18,538 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-07 19:09:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:18,539 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-07 19:09:18,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-07 19:09:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:09:18,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:18,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:18,544 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 19:09:18,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-07 19:09:18,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:18,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437256420] [2019-12-07 19:09:18,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:18,605 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 19:09:18,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437256420] [2019-12-07 19:09:18,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:18,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:09:18,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396538084] [2019-12-07 19:09:18,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:09:18,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:18,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:09:18,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:09:18,606 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-07 19:09:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:18,801 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-07 19:09:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:09:18,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 19:09:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:18,807 INFO L225 Difference]: With dead ends: 7088 [2019-12-07 19:09:18,807 INFO L226 Difference]: Without dead ends: 7088 [2019-12-07 19:09:18,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:09:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-07 19:09:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-07 19:09:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-07 19:09:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-07 19:09:18,890 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-07 19:09:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:18,891 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-07 19:09:18,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:09:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-07 19:09:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 19:09:18,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:18,898 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 19:09:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:18,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-07 19:09:18,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:18,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714051101] [2019-12-07 19:09:18,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:18,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 19:09:18,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714051101] [2019-12-07 19:09:18,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:18,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:18,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371004144] [2019-12-07 19:09:18,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:18,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:18,950 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 3 states. [2019-12-07 19:09:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:18,968 INFO L93 Difference]: Finished difference Result 5666 states and 16104 transitions. [2019-12-07 19:09:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:18,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 19:09:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:18,973 INFO L225 Difference]: With dead ends: 5666 [2019-12-07 19:09:18,973 INFO L226 Difference]: Without dead ends: 5666 [2019-12-07 19:09:18,974 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 19:09:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2019-12-07 19:09:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 5378. [2019-12-07 19:09:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5378 states. [2019-12-07 19:09:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 15312 transitions. [2019-12-07 19:09:19,042 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 15312 transitions. Word has length 65 [2019-12-07 19:09:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:19,042 INFO L462 AbstractCegarLoop]: Abstraction has 5378 states and 15312 transitions. [2019-12-07 19:09:19,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 15312 transitions. [2019-12-07 19:09:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 19:09:19,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:19,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:09:19,049 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 19:09:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash 373738635, now seen corresponding path program 1 times [2019-12-07 19:09:19,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:19,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709271065] [2019-12-07 19:09:19,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:19,110 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 19:09:19,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709271065] [2019-12-07 19:09:19,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:19,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:19,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825452144] [2019-12-07 19:09:19,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:19,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:19,111 INFO L87 Difference]: Start difference. First operand 5378 states and 15312 transitions. Second operand 3 states. [2019-12-07 19:09:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:19,132 INFO L93 Difference]: Finished difference Result 5378 states and 15072 transitions. [2019-12-07 19:09:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:19,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 19:09:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:19,136 INFO L225 Difference]: With dead ends: 5378 [2019-12-07 19:09:19,137 INFO L226 Difference]: Without dead ends: 5378 [2019-12-07 19:09:19,137 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 19:09:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2019-12-07 19:09:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5174. [2019-12-07 19:09:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5174 states. [2019-12-07 19:09:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 14518 transitions. [2019-12-07 19:09:19,199 INFO L78 Accepts]: Start accepts. Automaton has 5174 states and 14518 transitions. Word has length 66 [2019-12-07 19:09:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:19,199 INFO L462 AbstractCegarLoop]: Abstraction has 5174 states and 14518 transitions. [2019-12-07 19:09:19,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5174 states and 14518 transitions. [2019-12-07 19:09:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:09:19,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:19,205 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 19:09:19,205 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 19:09:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 184206773, now seen corresponding path program 1 times [2019-12-07 19:09:19,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:19,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914870438] [2019-12-07 19:09:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:09:19,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914870438] [2019-12-07 19:09:19,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:19,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:09:19,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053725993] [2019-12-07 19:09:19,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:09:19,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:09:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:09:19,266 INFO L87 Difference]: Start difference. First operand 5174 states and 14518 transitions. Second operand 3 states. [2019-12-07 19:09:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:19,300 INFO L93 Difference]: Finished difference Result 5174 states and 14517 transitions. [2019-12-07 19:09:19,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:09:19,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 19:09:19,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:19,304 INFO L225 Difference]: With dead ends: 5174 [2019-12-07 19:09:19,305 INFO L226 Difference]: Without dead ends: 5174 [2019-12-07 19:09:19,305 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 19:09:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2019-12-07 19:09:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 2987. [2019-12-07 19:09:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2019-12-07 19:09:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 8451 transitions. [2019-12-07 19:09:19,350 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 8451 transitions. Word has length 67 [2019-12-07 19:09:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:19,350 INFO L462 AbstractCegarLoop]: Abstraction has 2987 states and 8451 transitions. [2019-12-07 19:09:19,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:09:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 8451 transitions. [2019-12-07 19:09:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:19,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:19,353 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 19:09:19,353 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 19:09:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 823194101, now seen corresponding path program 1 times [2019-12-07 19:09:19,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:19,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501619557] [2019-12-07 19:09:19,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:19,434 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 19:09:19,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501619557] [2019-12-07 19:09:19,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:19,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:09:19,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801415696] [2019-12-07 19:09:19,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:09:19,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:19,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:09:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:09:19,435 INFO L87 Difference]: Start difference. First operand 2987 states and 8451 transitions. Second operand 7 states. [2019-12-07 19:09:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:19,495 INFO L93 Difference]: Finished difference Result 6098 states and 17352 transitions. [2019-12-07 19:09:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:09:19,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-07 19:09:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:19,499 INFO L225 Difference]: With dead ends: 6098 [2019-12-07 19:09:19,499 INFO L226 Difference]: Without dead ends: 3695 [2019-12-07 19:09:19,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:09:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2019-12-07 19:09:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 2815. [2019-12-07 19:09:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-07 19:09:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-07 19:09:19,540 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 68 [2019-12-07 19:09:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:19,540 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-07 19:09:19,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:09:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-07 19:09:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:19,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:19,544 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 19:09:19,544 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 19:09:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 2 times [2019-12-07 19:09:19,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:19,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793432460] [2019-12-07 19:09:19,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:20,216 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 19:09:20,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793432460] [2019-12-07 19:09:20,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:20,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 19:09:20,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162418416] [2019-12-07 19:09:20,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 19:09:20,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 19:09:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:09:20,218 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 22 states. [2019-12-07 19:09:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:22,676 INFO L93 Difference]: Finished difference Result 8146 states and 22576 transitions. [2019-12-07 19:09:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 19:09:22,677 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-07 19:09:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:22,683 INFO L225 Difference]: With dead ends: 8146 [2019-12-07 19:09:22,683 INFO L226 Difference]: Without dead ends: 8116 [2019-12-07 19:09:22,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=2169, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 19:09:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8116 states. [2019-12-07 19:09:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8116 to 4160. [2019-12-07 19:09:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-07 19:09:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11553 transitions. [2019-12-07 19:09:22,750 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11553 transitions. Word has length 68 [2019-12-07 19:09:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:22,750 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11553 transitions. [2019-12-07 19:09:22,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 19:09:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11553 transitions. [2019-12-07 19:09:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:22,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:22,755 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 19:09:22,755 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 19:09:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1309489219, now seen corresponding path program 3 times [2019-12-07 19:09:22,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:22,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699358931] [2019-12-07 19:09:22,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:22,953 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 19:09:22,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699358931] [2019-12-07 19:09:22,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:22,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 19:09:22,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597922927] [2019-12-07 19:09:22,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:09:22,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:22,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:09:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:09:22,954 INFO L87 Difference]: Start difference. First operand 4160 states and 11553 transitions. Second operand 13 states. [2019-12-07 19:09:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:23,334 INFO L93 Difference]: Finished difference Result 7461 states and 20720 transitions. [2019-12-07 19:09:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:09:23,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-07 19:09:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:23,340 INFO L225 Difference]: With dead ends: 7461 [2019-12-07 19:09:23,340 INFO L226 Difference]: Without dead ends: 7431 [2019-12-07 19:09:23,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-07 19:09:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2019-12-07 19:09:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 4339. [2019-12-07 19:09:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2019-12-07 19:09:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 12106 transitions. [2019-12-07 19:09:23,404 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 12106 transitions. Word has length 68 [2019-12-07 19:09:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:23,404 INFO L462 AbstractCegarLoop]: Abstraction has 4339 states and 12106 transitions. [2019-12-07 19:09:23,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:09:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 12106 transitions. [2019-12-07 19:09:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:23,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:23,409 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 19:09:23,409 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 19:09:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2103102647, now seen corresponding path program 4 times [2019-12-07 19:09:23,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:23,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776841109] [2019-12-07 19:09:23,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:23,894 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 19:09:23,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776841109] [2019-12-07 19:09:23,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:23,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 19:09:23,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298354376] [2019-12-07 19:09:23,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 19:09:23,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 19:09:23,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:09:23,896 INFO L87 Difference]: Start difference. First operand 4339 states and 12106 transitions. Second operand 18 states. [2019-12-07 19:09:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:26,475 INFO L93 Difference]: Finished difference Result 13851 states and 38672 transitions. [2019-12-07 19:09:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-07 19:09:26,475 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-07 19:09:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:26,487 INFO L225 Difference]: With dead ends: 13851 [2019-12-07 19:09:26,487 INFO L226 Difference]: Without dead ends: 13821 [2019-12-07 19:09:26,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=726, Invalid=4244, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 19:09:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2019-12-07 19:09:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 5809. [2019-12-07 19:09:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5809 states. [2019-12-07 19:09:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 16392 transitions. [2019-12-07 19:09:26,598 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 16392 transitions. Word has length 68 [2019-12-07 19:09:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:26,599 INFO L462 AbstractCegarLoop]: Abstraction has 5809 states and 16392 transitions. [2019-12-07 19:09:26,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 19:09:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 16392 transitions. [2019-12-07 19:09:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:26,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:26,605 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 19:09:26,605 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 19:09:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2137516859, now seen corresponding path program 5 times [2019-12-07 19:09:26,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:26,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630005484] [2019-12-07 19:09:26,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:26,877 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 19:09:26,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630005484] [2019-12-07 19:09:26,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:26,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 19:09:26,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719125992] [2019-12-07 19:09:26,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:09:26,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:09:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:09:26,878 INFO L87 Difference]: Start difference. First operand 5809 states and 16392 transitions. Second operand 16 states. [2019-12-07 19:09:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:28,131 INFO L93 Difference]: Finished difference Result 13212 states and 36809 transitions. [2019-12-07 19:09:28,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 19:09:28,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-07 19:09:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:28,153 INFO L225 Difference]: With dead ends: 13212 [2019-12-07 19:09:28,153 INFO L226 Difference]: Without dead ends: 13182 [2019-12-07 19:09:28,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 19:09:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13182 states. [2019-12-07 19:09:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13182 to 6316. [2019-12-07 19:09:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-12-07 19:09:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 17851 transitions. [2019-12-07 19:09:28,276 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 17851 transitions. Word has length 68 [2019-12-07 19:09:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:28,276 INFO L462 AbstractCegarLoop]: Abstraction has 6316 states and 17851 transitions. [2019-12-07 19:09:28,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:09:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 17851 transitions. [2019-12-07 19:09:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:28,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:28,281 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 19:09:28,281 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 19:09:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:28,281 INFO L82 PathProgramCache]: Analyzing trace with hash 488301605, now seen corresponding path program 6 times [2019-12-07 19:09:28,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:28,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420705585] [2019-12-07 19:09:28,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:09:28,468 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 19:09:28,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420705585] [2019-12-07 19:09:28,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:09:28,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 19:09:28,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879116128] [2019-12-07 19:09:28,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:09:28,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:09:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:09:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:09:28,469 INFO L87 Difference]: Start difference. First operand 6316 states and 17851 transitions. Second operand 14 states. [2019-12-07 19:09:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:09:28,881 INFO L93 Difference]: Finished difference Result 8217 states and 22972 transitions. [2019-12-07 19:09:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 19:09:28,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-07 19:09:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:09:28,888 INFO L225 Difference]: With dead ends: 8217 [2019-12-07 19:09:28,888 INFO L226 Difference]: Without dead ends: 8187 [2019-12-07 19:09:28,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:09:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2019-12-07 19:09:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 4067. [2019-12-07 19:09:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-07 19:09:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-07 19:09:28,954 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-07 19:09:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:09:28,955 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-07 19:09:28,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:09:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-07 19:09:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:09:28,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:09:28,957 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 19:09:28,957 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 19:09:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:09:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 7 times [2019-12-07 19:09:28,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:09:28,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868909998] [2019-12-07 19:09:28,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:09:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:09:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:09:29,046 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:09:29,046 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:09:29,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2037~0.base_21| 4) |v_#length_25|) (= v_~z$r_buff1_thd0~0_308 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21|)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2037~0.base_21|) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21| 1)) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21|) |v_ULTIMATE.start_main_~#t2037~0.offset_17| 0)) |v_#memory_int_21|) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= 0 |v_ULTIMATE.start_main_~#t2037~0.offset_17|) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_20|, ~x~0=v_~x~0_138, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t2037~0.base=|v_ULTIMATE.start_main_~#t2037~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t2037~0.offset=|v_ULTIMATE.start_main_~#t2037~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2038~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2039~0.base, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2037~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t2037~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:09:29,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2038~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t2038~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2038~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12|) |v_ULTIMATE.start_main_~#t2038~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t2038~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2038~0.base, #length] because there is no mapped edge [2019-12-07 19:09:29,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_20|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_225 256))) (not (= 0 (mod v_~z$w_buff1_used~0_114 256))))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_20|) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_24 0)) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 19:09:29,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2039~0.base_9| 4)) (= 0 |v_ULTIMATE.start_main_~#t2039~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2039~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9|) |v_ULTIMATE.start_main_~#t2039~0.offset_8| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t2039~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_8|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2039~0.base] because there is no mapped edge [2019-12-07 19:09:29,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1179045677 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1179045677 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1179045677|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1179045677 |P0Thread1of1ForFork0_#t~ite5_Out-1179045677|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179045677, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1179045677} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1179045677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179045677, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1179045677} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:09:29,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In-928969378 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-928969378 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-928969378 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-928969378 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-928969378|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-928969378 |P0Thread1of1ForFork0_#t~ite6_Out-928969378|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-928969378, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-928969378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928969378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-928969378} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-928969378|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-928969378, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-928969378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928969378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-928969378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:09:29,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In968733521 ~z$r_buff0_thd1~0_Out968733521)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In968733521 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In968733521 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~z$r_buff0_thd1~0_Out968733521) (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In968733521, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In968733521} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In968733521, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out968733521|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out968733521} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:09:29,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1263679357 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1263679357 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1263679357 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1263679357 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1263679357| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1263679357| ~z$r_buff1_thd1~0_In-1263679357)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263679357, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1263679357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263679357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1263679357} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263679357, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1263679357|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1263679357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263679357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1263679357} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:09:29,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:09:29,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1290905860| |P1Thread1of1ForFork1_#t~ite9_Out1290905860|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1290905860 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1290905860 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1290905860 |P1Thread1of1ForFork1_#t~ite9_Out1290905860|)) (and (= ~z~0_In1290905860 |P1Thread1of1ForFork1_#t~ite9_Out1290905860|) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1290905860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1290905860, ~z$w_buff1~0=~z$w_buff1~0_In1290905860, ~z~0=~z~0_In1290905860} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1290905860|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1290905860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1290905860, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1290905860|, ~z$w_buff1~0=~z$w_buff1~0_In1290905860, ~z~0=~z~0_In1290905860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 19:09:29,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-2039380594 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2039380594 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-2039380594 |P2Thread1of1ForFork2_#t~ite15_Out-2039380594|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-2039380594 |P2Thread1of1ForFork2_#t~ite15_Out-2039380594|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2039380594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2039380594, ~z$w_buff1~0=~z$w_buff1~0_In-2039380594, ~z~0=~z~0_In-2039380594} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-2039380594|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2039380594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2039380594, ~z$w_buff1~0=~z$w_buff1~0_In-2039380594, ~z~0=~z~0_In-2039380594} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 19:09:29,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 19:09:29,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-612522564 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-612522564 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-612522564| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-612522564| ~z$w_buff0_used~0_In-612522564) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-612522564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-612522564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-612522564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-612522564, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-612522564|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:09:29,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1921554792 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1921554792 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1921554792 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1921554792 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1921554792|)) (and (= ~z$w_buff1_used~0_In-1921554792 |P2Thread1of1ForFork2_#t~ite18_Out-1921554792|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1921554792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1921554792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1921554792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1921554792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1921554792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1921554792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1921554792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1921554792, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1921554792|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 19:09:29,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1500518232 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1500518232 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1500518232| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1500518232 |P2Thread1of1ForFork2_#t~ite19_Out-1500518232|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1500518232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1500518232} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1500518232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1500518232, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1500518232|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 19:09:29,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1189064342 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1189064342 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1189064342 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1189064342 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1189064342| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite20_Out-1189064342| ~z$r_buff1_thd3~0_In-1189064342) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189064342, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1189064342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189064342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1189064342} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189064342, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1189064342|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1189064342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189064342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1189064342} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 19:09:29,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_30| v_~z$r_buff1_thd3~0_67)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:09:29,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In847495186 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In847495186 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out847495186| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out847495186| ~z$w_buff0_used~0_In847495186) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In847495186, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In847495186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In847495186, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out847495186|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In847495186} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:09:29,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-516925516 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-516925516 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-516925516 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-516925516 256) 0))) (or (and (= ~z$w_buff1_used~0_In-516925516 |P1Thread1of1ForFork1_#t~ite12_Out-516925516|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-516925516|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-516925516, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-516925516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516925516, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-516925516} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-516925516, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-516925516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516925516, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-516925516|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-516925516} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:09:29,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1242086709 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1242086709 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1242086709|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1242086709 |P1Thread1of1ForFork1_#t~ite13_Out-1242086709|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1242086709, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1242086709} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1242086709, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1242086709|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1242086709} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:09:29,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In875920522 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In875920522 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In875920522 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In875920522 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out875920522|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out875920522| ~z$r_buff1_thd2~0_In875920522) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In875920522, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In875920522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875920522, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In875920522} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In875920522, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In875920522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875920522, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out875920522|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In875920522} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:09:29,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_84) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:09:29,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:09:29,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1778705683| |ULTIMATE.start_main_#t~ite24_Out-1778705683|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1778705683 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1778705683 256) 0))) (or (and .cse0 (= ~z~0_In-1778705683 |ULTIMATE.start_main_#t~ite24_Out-1778705683|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-1778705683 |ULTIMATE.start_main_#t~ite24_Out-1778705683|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1778705683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778705683, ~z$w_buff1~0=~z$w_buff1~0_In-1778705683, ~z~0=~z~0_In-1778705683} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1778705683, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1778705683|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778705683, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1778705683|, ~z$w_buff1~0=~z$w_buff1~0_In-1778705683, ~z~0=~z~0_In-1778705683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-07 19:09:29,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-51037365 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-51037365 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-51037365|)) (and (= |ULTIMATE.start_main_#t~ite26_Out-51037365| ~z$w_buff0_used~0_In-51037365) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-51037365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-51037365} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-51037365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-51037365, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-51037365|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 19:09:29,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1957311214 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1957311214 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1957311214 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1957311214 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1957311214|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1957311214 |ULTIMATE.start_main_#t~ite27_Out-1957311214|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1957311214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1957311214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1957311214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1957311214} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1957311214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1957311214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1957311214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1957311214, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1957311214|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 19:09:29,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1162972327 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1162972327 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out1162972327|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1162972327| ~z$r_buff0_thd0~0_In1162972327)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1162972327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1162972327} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1162972327, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1162972327|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1162972327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 19:09:29,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1867632557 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1867632557 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1867632557 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1867632557 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-1867632557| ~z$r_buff1_thd0~0_In-1867632557) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1867632557| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867632557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867632557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867632557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867632557} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867632557, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1867632557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867632557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867632557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867632557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 19:09:29,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:09:29,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:09:29,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 19:09:29,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:09:29 BasicIcfg [2019-12-07 19:09:29,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:09:29,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:09:29,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:09:29,112 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:09:29,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:08:30" (3/4) ... [2019-12-07 19:09:29,113 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:09:29,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2037~0.base_21| 4) |v_#length_25|) (= v_~z$r_buff1_thd0~0_308 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21|)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2037~0.base_21|) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21| 1)) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21|) |v_ULTIMATE.start_main_~#t2037~0.offset_17| 0)) |v_#memory_int_21|) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= 0 |v_ULTIMATE.start_main_~#t2037~0.offset_17|) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_20|, ~x~0=v_~x~0_138, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t2037~0.base=|v_ULTIMATE.start_main_~#t2037~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t2037~0.offset=|v_ULTIMATE.start_main_~#t2037~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2038~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2039~0.base, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2037~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t2037~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:09:29,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2038~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t2038~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2038~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12|) |v_ULTIMATE.start_main_~#t2038~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t2038~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2038~0.base, #length] because there is no mapped edge [2019-12-07 19:09:29,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_20|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_225 256))) (not (= 0 (mod v_~z$w_buff1_used~0_114 256))))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_20|) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_24 0)) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 19:09:29,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2039~0.base_9| 4)) (= 0 |v_ULTIMATE.start_main_~#t2039~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2039~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9|) |v_ULTIMATE.start_main_~#t2039~0.offset_8| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t2039~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_8|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2039~0.base] because there is no mapped edge [2019-12-07 19:09:29,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1179045677 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1179045677 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1179045677|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1179045677 |P0Thread1of1ForFork0_#t~ite5_Out-1179045677|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179045677, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1179045677} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1179045677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179045677, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1179045677} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 19:09:29,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In-928969378 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-928969378 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-928969378 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-928969378 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-928969378|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-928969378 |P0Thread1of1ForFork0_#t~ite6_Out-928969378|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-928969378, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-928969378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928969378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-928969378} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-928969378|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-928969378, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-928969378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928969378, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-928969378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 19:09:29,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In968733521 ~z$r_buff0_thd1~0_Out968733521)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In968733521 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In968733521 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~z$r_buff0_thd1~0_Out968733521) (not .cse2) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In968733521, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In968733521} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In968733521, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out968733521|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out968733521} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:09:29,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1263679357 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1263679357 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1263679357 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1263679357 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1263679357| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1263679357| ~z$r_buff1_thd1~0_In-1263679357)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263679357, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1263679357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263679357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1263679357} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263679357, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1263679357|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1263679357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263679357, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1263679357} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 19:09:29,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 19:09:29,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out1290905860| |P1Thread1of1ForFork1_#t~ite9_Out1290905860|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1290905860 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1290905860 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In1290905860 |P1Thread1of1ForFork1_#t~ite9_Out1290905860|)) (and (= ~z~0_In1290905860 |P1Thread1of1ForFork1_#t~ite9_Out1290905860|) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1290905860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1290905860, ~z$w_buff1~0=~z$w_buff1~0_In1290905860, ~z~0=~z~0_In1290905860} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1290905860|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1290905860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1290905860, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1290905860|, ~z$w_buff1~0=~z$w_buff1~0_In1290905860, ~z~0=~z~0_In1290905860} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 19:09:29,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-2039380594 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2039380594 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-2039380594 |P2Thread1of1ForFork2_#t~ite15_Out-2039380594|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-2039380594 |P2Thread1of1ForFork2_#t~ite15_Out-2039380594|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2039380594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2039380594, ~z$w_buff1~0=~z$w_buff1~0_In-2039380594, ~z~0=~z~0_In-2039380594} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-2039380594|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2039380594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2039380594, ~z$w_buff1~0=~z$w_buff1~0_In-2039380594, ~z~0=~z~0_In-2039380594} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 19:09:29,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 19:09:29,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-612522564 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-612522564 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-612522564| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-612522564| ~z$w_buff0_used~0_In-612522564) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-612522564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-612522564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-612522564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-612522564, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-612522564|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:09:29,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1921554792 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1921554792 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1921554792 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1921554792 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1921554792|)) (and (= ~z$w_buff1_used~0_In-1921554792 |P2Thread1of1ForFork2_#t~ite18_Out-1921554792|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1921554792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1921554792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1921554792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1921554792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1921554792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1921554792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1921554792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1921554792, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1921554792|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 19:09:29,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1500518232 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1500518232 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1500518232| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1500518232 |P2Thread1of1ForFork2_#t~ite19_Out-1500518232|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1500518232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1500518232} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1500518232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1500518232, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1500518232|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 19:09:29,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1189064342 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1189064342 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1189064342 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1189064342 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1189064342| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite20_Out-1189064342| ~z$r_buff1_thd3~0_In-1189064342) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189064342, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1189064342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189064342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1189064342} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189064342, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1189064342|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1189064342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189064342, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1189064342} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 19:09:29,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_30| v_~z$r_buff1_thd3~0_67)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 19:09:29,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In847495186 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In847495186 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out847495186| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out847495186| ~z$w_buff0_used~0_In847495186) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In847495186, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In847495186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In847495186, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out847495186|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In847495186} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 19:09:29,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-516925516 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-516925516 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-516925516 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-516925516 256) 0))) (or (and (= ~z$w_buff1_used~0_In-516925516 |P1Thread1of1ForFork1_#t~ite12_Out-516925516|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-516925516|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-516925516, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-516925516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516925516, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-516925516} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-516925516, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-516925516, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-516925516, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-516925516|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-516925516} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 19:09:29,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1242086709 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1242086709 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1242086709|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1242086709 |P1Thread1of1ForFork1_#t~ite13_Out-1242086709|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1242086709, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1242086709} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1242086709, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1242086709|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1242086709} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 19:09:29,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In875920522 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In875920522 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In875920522 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In875920522 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out875920522|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out875920522| ~z$r_buff1_thd2~0_In875920522) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In875920522, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In875920522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875920522, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In875920522} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In875920522, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In875920522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In875920522, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out875920522|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In875920522} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 19:09:29,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_84) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 19:09:29,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:09:29,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1778705683| |ULTIMATE.start_main_#t~ite24_Out-1778705683|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1778705683 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1778705683 256) 0))) (or (and .cse0 (= ~z~0_In-1778705683 |ULTIMATE.start_main_#t~ite24_Out-1778705683|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-1778705683 |ULTIMATE.start_main_#t~ite24_Out-1778705683|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1778705683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778705683, ~z$w_buff1~0=~z$w_buff1~0_In-1778705683, ~z~0=~z~0_In-1778705683} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1778705683, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1778705683|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1778705683, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1778705683|, ~z$w_buff1~0=~z$w_buff1~0_In-1778705683, ~z~0=~z~0_In-1778705683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-07 19:09:29,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-51037365 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-51037365 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-51037365|)) (and (= |ULTIMATE.start_main_#t~ite26_Out-51037365| ~z$w_buff0_used~0_In-51037365) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-51037365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-51037365} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-51037365, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-51037365, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-51037365|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 19:09:29,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1957311214 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1957311214 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1957311214 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1957311214 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1957311214|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1957311214 |ULTIMATE.start_main_#t~ite27_Out-1957311214|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1957311214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1957311214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1957311214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1957311214} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1957311214, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1957311214, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1957311214, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1957311214, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1957311214|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 19:09:29,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1162972327 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1162972327 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out1162972327|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1162972327| ~z$r_buff0_thd0~0_In1162972327)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1162972327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1162972327} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1162972327, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1162972327|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1162972327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 19:09:29,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1867632557 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1867632557 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1867632557 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1867632557 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-1867632557| ~z$r_buff1_thd0~0_In-1867632557) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1867632557| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867632557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867632557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867632557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867632557} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1867632557, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1867632557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1867632557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1867632557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1867632557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 19:09:29,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 19:09:29,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:09:29,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 19:09:29,175 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_86d1b80e-efbf-415a-b8ab-f5ca34620f34/bin/utaipan/witness.graphml [2019-12-07 19:09:29,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:09:29,176 INFO L168 Benchmark]: Toolchain (without parser) took 59229.17 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 936.5 MB in the beginning and 1.8 GB in the end (delta: -885.3 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:29,176 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:09:29,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:29,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.98 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 19:09:29,177 INFO L168 Benchmark]: Boogie Preprocessor took 24.63 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 19:09:29,177 INFO L168 Benchmark]: RCFGBuilder took 405.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.9 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:29,178 INFO L168 Benchmark]: TraceAbstraction took 58276.97 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 994.6 MB in the beginning and 1.8 GB in the end (delta: -841.3 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 19:09:29,178 INFO L168 Benchmark]: Witness Printer took 63.83 ms. Allocated memory is still 6.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:09:29,179 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.63 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.9 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58276.97 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 994.6 MB in the beginning and 1.8 GB in the end (delta: -841.3 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 63.83 ms. Allocated memory is still 6.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 58.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3329 SDtfs, 4363 SDslu, 12448 SDs, 0 SdLazy, 8900 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 26 SyntacticMatches, 22 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2436 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 104185 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1009 NumberOfCodeBlocks, 1009 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 354301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...