./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/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 b37fd9a6d9373ee025228ed18673aff9b4a368f6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:19:10,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:19:10,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:19:10,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:19:10,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:19:10,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:19:10,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:19:10,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:19:10,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:19:10,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:19:10,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:19:10,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:19:10,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:19:10,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:19:10,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:19:10,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:19:10,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:19:10,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:19:10,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:19:10,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:19:10,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:19:10,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:19:10,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:19:10,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:19:10,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:19:10,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:19:10,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:19:10,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:19:10,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:19:10,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:19:10,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:19:10,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:19:10,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:19:10,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:19:10,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:19:10,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:19:10,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:19:10,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:19:10,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:19:10,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:19:10,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:19:10,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:19:10,797 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:19:10,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:19:10,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:19:10,798 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:19:10,798 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:19:10,798 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:19:10,799 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:19:10,799 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:19:10,799 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:19:10,799 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:19:10,799 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:19:10,799 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:19:10,799 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:19:10,800 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:19:10,800 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:19:10,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:19:10,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:19:10,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:19:10,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:19:10,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:19:10,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:19:10,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:19:10,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:19:10,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:19:10,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:19:10,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:19:10,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:19:10,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:19:10,803 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:19:10,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:19:10,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:19:10,803 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:19:10,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:19:10,803 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_714a6545-a5c6-4782-9303-67d2145756ab/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 -> b37fd9a6d9373ee025228ed18673aff9b4a368f6 [2019-12-07 10:19:10,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:19:10,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:19:10,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:19:10,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:19:10,916 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:19:10,917 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i [2019-12-07 10:19:10,963 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/data/a0024839a/b76c5318ef574c10a3e1c3ad47fd0528/FLAG535044b09 [2019-12-07 10:19:11,342 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:19:11,342 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i [2019-12-07 10:19:11,352 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/data/a0024839a/b76c5318ef574c10a3e1c3ad47fd0528/FLAG535044b09 [2019-12-07 10:19:11,364 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/data/a0024839a/b76c5318ef574c10a3e1c3ad47fd0528 [2019-12-07 10:19:11,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:19:11,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:19:11,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:19:11,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:19:11,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:19:11,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,374 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 10:19:11, skipping insertion in model container [2019-12-07 10:19:11,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:19:11,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:19:11,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:19:11,672 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:19:11,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:19:11,762 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:19:11,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11 WrapperNode [2019-12-07 10:19:11,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:19:11,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:19:11,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:19:11,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:19:11,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:19:11,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:19:11,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:19:11,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:19:11,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... [2019-12-07 10:19:11,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:19:11,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:19:11,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:19:11,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:19:11,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/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 10:19:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:19:11,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:19:11,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:19:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:19:11,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:19:11,876 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 10:19:12,200 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:19:12,200 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:19:12,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:19:12 BoogieIcfgContainer [2019-12-07 10:19:12,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:19:12,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:19:12,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:19:12,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:19:12,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:19:11" (1/3) ... [2019-12-07 10:19:12,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae173fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:19:12, skipping insertion in model container [2019-12-07 10:19:12,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:19:11" (2/3) ... [2019-12-07 10:19:12,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae173fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:19:12, skipping insertion in model container [2019-12-07 10:19:12,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:19:12" (3/3) ... [2019-12-07 10:19:12,206 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-12-07 10:19:12,212 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:19:12,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:19:12,216 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:19:12,217 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:19:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:19:12,268 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:19:12,280 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:19:12,280 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:19:12,280 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:19:12,280 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:19:12,280 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:19:12,280 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:19:12,280 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:19:12,281 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:19:12,290 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 10:19:12,292 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 10:19:12,342 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 10:19:12,342 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:19:12,350 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 10:19:12,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 10:19:12,388 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 10:19:12,388 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:19:12,392 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 10:19:12,402 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 10:19:12,403 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:19:15,021 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 10:19:15,130 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 10:19:15,130 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 10:19:15,132 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 10:19:15,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 10:19:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 10:19:15,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:19:15,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:15,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:19:15,467 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 10:19:15,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:15,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946022158] [2019-12-07 10:19:15,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:15,601 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 10:19:15,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946022158] [2019-12-07 10:19:15,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:15,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:19:15,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708306206] [2019-12-07 10:19:15,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:15,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:15,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:15,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:15,617 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 10:19:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:15,800 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 10:19:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:15,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:19:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:15,864 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 10:19:15,864 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 10:19:15,865 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 10:19:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 10:19:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 10:19:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 10:19:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 10:19:16,144 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 10:19:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:16,144 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 10:19:16,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 10:19:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:19:16,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:16,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:16,148 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 10:19:16,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:16,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350471805] [2019-12-07 10:19:16,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:16,223 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 10:19:16,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350471805] [2019-12-07 10:19:16,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:16,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:16,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043289428] [2019-12-07 10:19:16,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:16,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:16,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:16,225 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 10:19:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:16,470 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 10:19:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:19:16,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:19:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:16,527 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 10:19:16,528 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 10:19:16,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 10:19:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 10:19:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 10:19:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 10:19:16,811 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 10:19:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:16,811 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 10:19:16,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 10:19:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:19:16,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:16,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:16,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 10:19:16,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:16,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834146686] [2019-12-07 10:19:16,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:16,867 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 10:19:16,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834146686] [2019-12-07 10:19:16,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:16,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:16,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957866625] [2019-12-07 10:19:16,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:19:16,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:19:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:16,869 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 10:19:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:17,073 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 10:19:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:19:17,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:19:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:17,102 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 10:19:17,102 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 10:19:17,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:19:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 10:19:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 10:19:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 10:19:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 10:19:17,343 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 10:19:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:17,344 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 10:19:17,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:19:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 10:19:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:19:17,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:17,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:17,347 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:17,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:17,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 10:19:17,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:17,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214033812] [2019-12-07 10:19:17,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:17,391 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 10:19:17,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214033812] [2019-12-07 10:19:17,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:17,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:17,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517723142] [2019-12-07 10:19:17,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:17,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:17,392 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 10:19:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:17,426 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-07 10:19:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:17,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:19:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:17,441 INFO L225 Difference]: With dead ends: 10750 [2019-12-07 10:19:17,441 INFO L226 Difference]: Without dead ends: 10750 [2019-12-07 10:19:17,441 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 10:19:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-07 10:19:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-07 10:19:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-07 10:19:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-07 10:19:17,646 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-07 10:19:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:17,646 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-07 10:19:17,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-07 10:19:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:19:17,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:17,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:17,649 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:17,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-07 10:19:17,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:17,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834906667] [2019-12-07 10:19:17,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:17,697 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 10:19:17,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834906667] [2019-12-07 10:19:17,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:17,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:19:17,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749372950] [2019-12-07 10:19:17,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:17,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:17,699 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 3 states. [2019-12-07 10:19:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:17,726 INFO L93 Difference]: Finished difference Result 10645 states and 33030 transitions. [2019-12-07 10:19:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:17,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:19:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:17,740 INFO L225 Difference]: With dead ends: 10645 [2019-12-07 10:19:17,740 INFO L226 Difference]: Without dead ends: 10645 [2019-12-07 10:19:17,740 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 10:19:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10645 states. [2019-12-07 10:19:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10645 to 10645. [2019-12-07 10:19:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10645 states. [2019-12-07 10:19:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 33030 transitions. [2019-12-07 10:19:17,910 INFO L78 Accepts]: Start accepts. Automaton has 10645 states and 33030 transitions. Word has length 16 [2019-12-07 10:19:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:17,910 INFO L462 AbstractCegarLoop]: Abstraction has 10645 states and 33030 transitions. [2019-12-07 10:19:17,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10645 states and 33030 transitions. [2019-12-07 10:19:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:19:17,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:17,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:17,913 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash -680515989, now seen corresponding path program 1 times [2019-12-07 10:19:17,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:17,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508154467] [2019-12-07 10:19:17,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:17,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 10:19:17,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508154467] [2019-12-07 10:19:17,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:17,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:17,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462651448] [2019-12-07 10:19:17,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:17,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:17,954 INFO L87 Difference]: Start difference. First operand 10645 states and 33030 transitions. Second operand 4 states. [2019-12-07 10:19:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:18,011 INFO L93 Difference]: Finished difference Result 15274 states and 47713 transitions. [2019-12-07 10:19:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:19:18,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 10:19:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:18,029 INFO L225 Difference]: With dead ends: 15274 [2019-12-07 10:19:18,029 INFO L226 Difference]: Without dead ends: 15274 [2019-12-07 10:19:18,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-07 10:19:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15237. [2019-12-07 10:19:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15237 states. [2019-12-07 10:19:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 47658 transitions. [2019-12-07 10:19:18,285 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 47658 transitions. Word has length 17 [2019-12-07 10:19:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:18,285 INFO L462 AbstractCegarLoop]: Abstraction has 15237 states and 47658 transitions. [2019-12-07 10:19:18,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 47658 transitions. [2019-12-07 10:19:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:19:18,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:18,290 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 10:19:18,290 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-12-07 10:19:18,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:18,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022299006] [2019-12-07 10:19:18,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:18,332 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 10:19:18,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022299006] [2019-12-07 10:19:18,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:18,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:19:18,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420193961] [2019-12-07 10:19:18,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:19:18,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:19:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:19:18,333 INFO L87 Difference]: Start difference. First operand 15237 states and 47658 transitions. Second operand 4 states. [2019-12-07 10:19:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:18,354 INFO L93 Difference]: Finished difference Result 2805 states and 7141 transitions. [2019-12-07 10:19:18,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:19:18,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:19:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:18,356 INFO L225 Difference]: With dead ends: 2805 [2019-12-07 10:19:18,356 INFO L226 Difference]: Without dead ends: 1955 [2019-12-07 10:19:18,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-12-07 10:19:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2019-12-07 10:19:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2019-12-07 10:19:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 4404 transitions. [2019-12-07 10:19:18,375 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 4404 transitions. Word has length 19 [2019-12-07 10:19:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:18,375 INFO L462 AbstractCegarLoop]: Abstraction has 1955 states and 4404 transitions. [2019-12-07 10:19:18,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:19:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 4404 transitions. [2019-12-07 10:19:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:19:18,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:18,377 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] [2019-12-07 10:19:18,377 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:18,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 10:19:18,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:18,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916308148] [2019-12-07 10:19:18,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:18,422 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 10:19:18,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916308148] [2019-12-07 10:19:18,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:18,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:19:18,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671432439] [2019-12-07 10:19:18,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:19:18,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:19:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:19:18,423 INFO L87 Difference]: Start difference. First operand 1955 states and 4404 transitions. Second operand 6 states. [2019-12-07 10:19:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:18,666 INFO L93 Difference]: Finished difference Result 2745 states and 5950 transitions. [2019-12-07 10:19:18,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:19:18,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 10:19:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:18,669 INFO L225 Difference]: With dead ends: 2745 [2019-12-07 10:19:18,669 INFO L226 Difference]: Without dead ends: 2693 [2019-12-07 10:19:18,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:19:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2019-12-07 10:19:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1926. [2019-12-07 10:19:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-12-07 10:19:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4340 transitions. [2019-12-07 10:19:18,688 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4340 transitions. Word has length 24 [2019-12-07 10:19:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:18,688 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 4340 transitions. [2019-12-07 10:19:18,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:19:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4340 transitions. [2019-12-07 10:19:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:19:18,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:18,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:18,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-07 10:19:18,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:18,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965556741] [2019-12-07 10:19:18,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:18,753 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 10:19:18,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965556741] [2019-12-07 10:19:18,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:18,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:19:18,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966344449] [2019-12-07 10:19:18,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:19:18,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:18,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:19:18,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:18,754 INFO L87 Difference]: Start difference. First operand 1926 states and 4340 transitions. Second operand 5 states. [2019-12-07 10:19:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:18,784 INFO L93 Difference]: Finished difference Result 1028 states and 2299 transitions. [2019-12-07 10:19:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:19:18,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:19:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:18,786 INFO L225 Difference]: With dead ends: 1028 [2019-12-07 10:19:18,786 INFO L226 Difference]: Without dead ends: 942 [2019-12-07 10:19:18,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:19:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-12-07 10:19:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 689. [2019-12-07 10:19:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 10:19:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-07 10:19:18,793 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 28 [2019-12-07 10:19:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:18,793 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-07 10:19:18,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:19:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-07 10:19:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:19:18,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:18,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:18,795 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-07 10:19:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:18,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276539582] [2019-12-07 10:19:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:18,853 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 10:19:18,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276539582] [2019-12-07 10:19:18,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:18,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:19:18,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70471132] [2019-12-07 10:19:18,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:19:18,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:19:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:19:18,854 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-12-07 10:19:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:19,071 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-12-07 10:19:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:19:19,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 10:19:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:19,072 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 10:19:19,072 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 10:19:19,073 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 10:19:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 10:19:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-12-07 10:19:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 10:19:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-12-07 10:19:19,081 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-12-07 10:19:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:19,081 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-12-07 10:19:19,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:19:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-12-07 10:19:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:19:19,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:19,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:19,083 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-12-07 10:19:19,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:19,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647323563] [2019-12-07 10:19:19,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:19,124 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 10:19:19,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647323563] [2019-12-07 10:19:19,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:19,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:19:19,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558708320] [2019-12-07 10:19:19,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:19:19,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:19:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:19,125 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-12-07 10:19:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:19,165 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-12-07 10:19:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:19:19,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 10:19:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:19,166 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 10:19:19,166 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 10:19:19,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:19:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 10:19:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-12-07 10:19:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 10:19:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-12-07 10:19:19,175 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-12-07 10:19:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:19,176 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-12-07 10:19:19,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:19:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-12-07 10:19:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:19:19,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:19,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:19,177 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-12-07 10:19:19,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:19,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525171670] [2019-12-07 10:19:19,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:19,344 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 10:19:19,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525171670] [2019-12-07 10:19:19,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:19,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:19:19,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862914563] [2019-12-07 10:19:19,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:19:19,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:19:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:19:19,345 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 11 states. [2019-12-07 10:19:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:19,725 INFO L93 Difference]: Finished difference Result 2426 states and 5230 transitions. [2019-12-07 10:19:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:19:19,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-07 10:19:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:19,726 INFO L225 Difference]: With dead ends: 2426 [2019-12-07 10:19:19,726 INFO L226 Difference]: Without dead ends: 759 [2019-12-07 10:19:19,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:19:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-07 10:19:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-12-07 10:19:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 10:19:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-12-07 10:19:19,732 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-12-07 10:19:19,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:19,733 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-12-07 10:19:19,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:19:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-12-07 10:19:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:19:19,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:19,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:19,734 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-12-07 10:19:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:19,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408391616] [2019-12-07 10:19:19,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:19:19,811 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 10:19:19,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408391616] [2019-12-07 10:19:19,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:19:19,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:19:19,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135704823] [2019-12-07 10:19:19,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:19:19,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:19:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:19:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:19:19,812 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 7 states. [2019-12-07 10:19:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:19:19,941 INFO L93 Difference]: Finished difference Result 1345 states and 2865 transitions. [2019-12-07 10:19:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:19:19,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 10:19:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:19:19,942 INFO L225 Difference]: With dead ends: 1345 [2019-12-07 10:19:19,942 INFO L226 Difference]: Without dead ends: 919 [2019-12-07 10:19:19,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:19:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-07 10:19:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-12-07 10:19:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-07 10:19:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-07 10:19:19,951 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-12-07 10:19:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:19:19,951 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-07 10:19:19,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:19:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-07 10:19:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:19:19,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:19:19,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:19:19,953 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:19:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:19:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 3 times [2019-12-07 10:19:19,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:19:19,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390355309] [2019-12-07 10:19:19,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:19:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:19:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:19:20,055 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:19:20,055 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:19:20,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| 4)) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48|) |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2315~0.base_48|) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48|) 0) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48| 1)) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_31|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_49|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2315~0.offset=|v_ULTIMATE.start_main_~#t2315~0.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2315~0.base=|v_ULTIMATE.start_main_~#t2315~0.base_48|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2316~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2316~0.base, #NULL.base, ULTIMATE.start_main_~#t2315~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2315~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:19:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2316~0.offset_11| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13|) |v_ULTIMATE.start_main_~#t2316~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_13|, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2316~0.base, ULTIMATE.start_main_~#t2316~0.offset] because there is no mapped edge [2019-12-07 10:19:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-1531277962 ~y$r_buff0_thd2~0_In-1531277962) (= ~x~0_Out-1531277962 1) (= ~y$r_buff1_thd1~0_Out-1531277962 ~y$r_buff0_thd1~0_In-1531277962) (= ~y$r_buff0_thd1~0_Out-1531277962 1) (= ~y$r_buff1_thd0~0_Out-1531277962 ~y$r_buff0_thd0~0_In-1531277962) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1531277962 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1531277962, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1531277962, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1531277962} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1531277962, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1531277962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1531277962, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1531277962, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1531277962, ~x~0=~x~0_Out-1531277962, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1531277962} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:19:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In30958821 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In30958821 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out30958821| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out30958821| ~y$w_buff0_used~0_In30958821)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In30958821} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out30958821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In30958821} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:19:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-205656313 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-205656313| |P1Thread1of1ForFork1_#t~ite20_Out-205656313|) (= ~y$w_buff0_used~0_In-205656313 |P1Thread1of1ForFork1_#t~ite21_Out-205656313|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-205656313 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-205656313 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-205656313 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-205656313 256) 0)))) (= ~y$w_buff0_used~0_In-205656313 |P1Thread1of1ForFork1_#t~ite20_Out-205656313|) (= |P1Thread1of1ForFork1_#t~ite20_Out-205656313| |P1Thread1of1ForFork1_#t~ite21_Out-205656313|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-205656313, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-205656313, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-205656313|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-205656313, ~weak$$choice2~0=~weak$$choice2~0_In-205656313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205656313} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-205656313, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-205656313, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-205656313|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-205656313, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-205656313|, ~weak$$choice2~0=~weak$$choice2~0_In-205656313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205656313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 10:19:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2099069821 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out-2099069821| |P1Thread1of1ForFork1_#t~ite23_Out-2099069821|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2099069821 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2099069821 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-2099069821 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2099069821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-2099069821| |P1Thread1of1ForFork1_#t~ite22_Out-2099069821|) (or (and (or (and .cse0 .cse1) (and .cse0 .cse2) .cse3) (= |P1Thread1of1ForFork1_#t~ite23_Out-2099069821| ~y$w_buff1_used~0_In-2099069821) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-2099069821| ~y$w_buff1_used~0_In-2099069821) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-2099069821| |P1Thread1of1ForFork1_#t~ite23_In-2099069821|)))) (let ((.cse6 (not .cse0))) (and (or (not .cse2) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-2099069821| |P1Thread1of1ForFork1_#t~ite22_Out-2099069821|) .cse4 (or .cse6 (not .cse1)) (not .cse3) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-2099069821|) .cse5)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2099069821|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2099069821|, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2099069821|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2099069821|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2099069821|, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 10:19:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1107128676 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1107128676 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1107128676 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1107128676 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1107128676| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1107128676| ~y$w_buff1_used~0_In-1107128676) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1107128676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1107128676|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1107128676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:19:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In110272957 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_Out110272957 ~y$r_buff0_thd1~0_In110272957)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In110272957 256)))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out110272957 0) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110272957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out110272957|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out110272957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:19:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1418628245 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1418628245 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1418628245 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1418628245 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1418628245 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1418628245|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:19:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:19:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1931109068 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1931109068| |P1Thread1of1ForFork1_#t~ite29_Out1931109068|) (= ~y$r_buff1_thd2~0_In1931109068 |P1Thread1of1ForFork1_#t~ite30_Out1931109068|)) (and (= ~y$r_buff1_thd2~0_In1931109068 |P1Thread1of1ForFork1_#t~ite29_Out1931109068|) (= |P1Thread1of1ForFork1_#t~ite30_Out1931109068| |P1Thread1of1ForFork1_#t~ite29_Out1931109068|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1931109068 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1931109068 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1931109068 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1931109068 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1931109068, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1931109068|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1931109068, ~weak$$choice2~0=~weak$$choice2~0_In1931109068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1931109068} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1931109068, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1931109068|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1931109068|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1931109068, ~weak$$choice2~0=~weak$$choice2~0_In1931109068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1931109068} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 10:19:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 10:19:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In476328529 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In476328529 256)))) (or (and (= ~y~0_In476328529 |P1Thread1of1ForFork1_#t~ite32_Out476328529|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In476328529 |P1Thread1of1ForFork1_#t~ite32_Out476328529|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In476328529, ~y$w_buff1~0=~y$w_buff1~0_In476328529, ~y~0=~y~0_In476328529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In476328529} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In476328529, ~y$w_buff1~0=~y$w_buff1~0_In476328529, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out476328529|, ~y~0=~y~0_In476328529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In476328529} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:19:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 10:19:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-751478120 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-751478120 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-751478120 |P1Thread1of1ForFork1_#t~ite34_Out-751478120|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-751478120|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-751478120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751478120} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-751478120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751478120, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-751478120|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:19:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In300737084 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In300737084 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In300737084 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In300737084 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out300737084|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out300737084| ~y$w_buff1_used~0_In300737084) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In300737084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300737084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In300737084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out300737084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300737084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:19:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-294244269 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-294244269 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-294244269 |P1Thread1of1ForFork1_#t~ite36_Out-294244269|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-294244269|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-294244269|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:19:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1532077675 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1532077675 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1532077675 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1532077675 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1532077675| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1532077675| ~y$r_buff1_thd2~0_In1532077675)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1532077675, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1532077675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1532077675, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1532077675, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1532077675|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:19:20,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:19:20,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:19:20,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:19:20,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-99152115 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-99152115 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y$w_buff1~0_In-99152115) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y~0_In-99152115) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-99152115|, ~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:19:20,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 10:19:20,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In899375188 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In899375188 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out899375188|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In899375188 |ULTIMATE.start_main_#t~ite42_Out899375188|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out899375188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:19:20,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In694509339 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In694509339 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In694509339 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In694509339 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out694509339| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In694509339 |ULTIMATE.start_main_#t~ite43_Out694509339|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In694509339, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In694509339, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out694509339|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:19:20,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1068015932 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1068015932 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1068015932|)) (and (= ~y$r_buff0_thd0~0_In-1068015932 |ULTIMATE.start_main_#t~ite44_Out-1068015932|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1068015932} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1068015932, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1068015932|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:19:20,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-967587273 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-967587273 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-967587273 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-967587273 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-967587273| ~y$r_buff1_thd0~0_In-967587273) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-967587273| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-967587273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-967587273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-967587273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-967587273} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-967587273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-967587273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-967587273, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-967587273|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-967587273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:19:20,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:19:20,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:19:20 BasicIcfg [2019-12-07 10:19:20,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:19:20,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:19:20,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:19:20,105 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:19:20,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:19:12" (3/4) ... [2019-12-07 10:19:20,107 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:19:20,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| 4)) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48|) |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2315~0.base_48|) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48|) 0) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48| 1)) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_31|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_49|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2315~0.offset=|v_ULTIMATE.start_main_~#t2315~0.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2315~0.base=|v_ULTIMATE.start_main_~#t2315~0.base_48|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2316~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2316~0.base, #NULL.base, ULTIMATE.start_main_~#t2315~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2315~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:19:20,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2316~0.offset_11| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13|) |v_ULTIMATE.start_main_~#t2316~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_13|, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2316~0.base, ULTIMATE.start_main_~#t2316~0.offset] because there is no mapped edge [2019-12-07 10:19:20,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-1531277962 ~y$r_buff0_thd2~0_In-1531277962) (= ~x~0_Out-1531277962 1) (= ~y$r_buff1_thd1~0_Out-1531277962 ~y$r_buff0_thd1~0_In-1531277962) (= ~y$r_buff0_thd1~0_Out-1531277962 1) (= ~y$r_buff1_thd0~0_Out-1531277962 ~y$r_buff0_thd0~0_In-1531277962) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1531277962 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1531277962, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1531277962, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1531277962} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1531277962, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1531277962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531277962, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1531277962, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1531277962, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1531277962, ~x~0=~x~0_Out-1531277962, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1531277962} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:19:20,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In30958821 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In30958821 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out30958821| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out30958821| ~y$w_buff0_used~0_In30958821)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In30958821} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out30958821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In30958821} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:19:20,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-205656313 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-205656313| |P1Thread1of1ForFork1_#t~ite20_Out-205656313|) (= ~y$w_buff0_used~0_In-205656313 |P1Thread1of1ForFork1_#t~ite21_Out-205656313|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-205656313 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-205656313 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-205656313 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-205656313 256) 0)))) (= ~y$w_buff0_used~0_In-205656313 |P1Thread1of1ForFork1_#t~ite20_Out-205656313|) (= |P1Thread1of1ForFork1_#t~ite20_Out-205656313| |P1Thread1of1ForFork1_#t~ite21_Out-205656313|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-205656313, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-205656313, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-205656313|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-205656313, ~weak$$choice2~0=~weak$$choice2~0_In-205656313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205656313} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-205656313, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-205656313, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-205656313|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-205656313, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-205656313|, ~weak$$choice2~0=~weak$$choice2~0_In-205656313, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-205656313} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 10:19:20,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2099069821 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out-2099069821| |P1Thread1of1ForFork1_#t~ite23_Out-2099069821|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2099069821 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2099069821 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-2099069821 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2099069821 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-2099069821| |P1Thread1of1ForFork1_#t~ite22_Out-2099069821|) (or (and (or (and .cse0 .cse1) (and .cse0 .cse2) .cse3) (= |P1Thread1of1ForFork1_#t~ite23_Out-2099069821| ~y$w_buff1_used~0_In-2099069821) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-2099069821| ~y$w_buff1_used~0_In-2099069821) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-2099069821| |P1Thread1of1ForFork1_#t~ite23_In-2099069821|)))) (let ((.cse6 (not .cse0))) (and (or (not .cse2) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-2099069821| |P1Thread1of1ForFork1_#t~ite22_Out-2099069821|) .cse4 (or .cse6 (not .cse1)) (not .cse3) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-2099069821|) .cse5)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2099069821|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2099069821|, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2099069821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2099069821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2099069821, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2099069821|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2099069821|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2099069821|, ~weak$$choice2~0=~weak$$choice2~0_In-2099069821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2099069821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 10:19:20,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1107128676 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1107128676 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1107128676 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1107128676 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1107128676| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1107128676| ~y$w_buff1_used~0_In-1107128676) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1107128676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1107128676|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1107128676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:19:20,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In110272957 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_Out110272957 ~y$r_buff0_thd1~0_In110272957)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In110272957 256)))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out110272957 0) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110272957} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In110272957, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out110272957|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out110272957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:19:20,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1418628245 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1418628245 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1418628245 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1418628245 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1418628245 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1418628245|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:19:20,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:19:20,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1931109068 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1931109068| |P1Thread1of1ForFork1_#t~ite29_Out1931109068|) (= ~y$r_buff1_thd2~0_In1931109068 |P1Thread1of1ForFork1_#t~ite30_Out1931109068|)) (and (= ~y$r_buff1_thd2~0_In1931109068 |P1Thread1of1ForFork1_#t~ite29_Out1931109068|) (= |P1Thread1of1ForFork1_#t~ite30_Out1931109068| |P1Thread1of1ForFork1_#t~ite29_Out1931109068|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1931109068 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1931109068 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1931109068 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1931109068 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1931109068, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1931109068|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1931109068, ~weak$$choice2~0=~weak$$choice2~0_In1931109068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1931109068} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1931109068, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1931109068|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1931109068|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1931109068, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1931109068, ~weak$$choice2~0=~weak$$choice2~0_In1931109068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1931109068} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 10:19:20,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 10:19:20,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In476328529 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In476328529 256)))) (or (and (= ~y~0_In476328529 |P1Thread1of1ForFork1_#t~ite32_Out476328529|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In476328529 |P1Thread1of1ForFork1_#t~ite32_Out476328529|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In476328529, ~y$w_buff1~0=~y$w_buff1~0_In476328529, ~y~0=~y~0_In476328529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In476328529} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In476328529, ~y$w_buff1~0=~y$w_buff1~0_In476328529, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out476328529|, ~y~0=~y~0_In476328529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In476328529} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 10:19:20,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 10:19:20,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-751478120 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-751478120 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-751478120 |P1Thread1of1ForFork1_#t~ite34_Out-751478120|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-751478120|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-751478120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751478120} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-751478120, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-751478120, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-751478120|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 10:19:20,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In300737084 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In300737084 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In300737084 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In300737084 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out300737084|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out300737084| ~y$w_buff1_used~0_In300737084) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In300737084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300737084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In300737084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In300737084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In300737084, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out300737084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In300737084} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 10:19:20,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-294244269 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-294244269 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-294244269 |P1Thread1of1ForFork1_#t~ite36_Out-294244269|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-294244269|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-294244269|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1532077675 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1532077675 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1532077675 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1532077675 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1532077675| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out1532077675| ~y$r_buff1_thd2~0_In1532077675)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1532077675, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1532077675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1532077675, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1532077675, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1532077675, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1532077675|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1532077675} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-99152115 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-99152115 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y$w_buff1~0_In-99152115) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-99152115| ~y~0_In-99152115) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-99152115|, ~y$w_buff1~0=~y$w_buff1~0_In-99152115, ~y~0=~y~0_In-99152115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99152115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99152115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In899375188 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In899375188 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out899375188|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In899375188 |ULTIMATE.start_main_#t~ite42_Out899375188|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out899375188|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 10:19:20,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In694509339 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In694509339 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In694509339 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In694509339 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out694509339| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In694509339 |ULTIMATE.start_main_#t~ite43_Out694509339|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In694509339, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In694509339, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In694509339, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out694509339|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In694509339, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694509339} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 10:19:20,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1068015932 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1068015932 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1068015932|)) (and (= ~y$r_buff0_thd0~0_In-1068015932 |ULTIMATE.start_main_#t~ite44_Out-1068015932|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1068015932} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068015932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1068015932, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1068015932|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 10:19:20,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-967587273 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-967587273 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-967587273 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-967587273 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-967587273| ~y$r_buff1_thd0~0_In-967587273) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-967587273| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-967587273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-967587273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-967587273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-967587273} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-967587273, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-967587273, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-967587273, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-967587273|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-967587273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 10:19:20,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:19:20,162 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_714a6545-a5c6-4782-9303-67d2145756ab/bin/utaipan/witness.graphml [2019-12-07 10:19:20,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:19:20,163 INFO L168 Benchmark]: Toolchain (without parser) took 8796.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 401.6 MB). Free memory was 930.8 MB in the beginning and 1.3 GB in the end (delta: -379.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:19:20,163 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:19:20,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:19:20,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.77 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 10:19:20,164 INFO L168 Benchmark]: Boogie Preprocessor took 28.64 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 10:19:20,165 INFO L168 Benchmark]: RCFGBuilder took 370.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:19:20,165 INFO L168 Benchmark]: TraceAbstraction took 7902.45 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -316.6 MB). Peak memory consumption was 559.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:19:20,165 INFO L168 Benchmark]: Witness Printer took 57.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:19:20,167 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 952.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.77 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 28.64 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 370.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7902.45 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 306.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -316.6 MB). Peak memory consumption was 559.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 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: 2.8s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1502 SDtfs, 2197 SDslu, 2999 SDs, 0 SdLazy, 1682 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15237occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 6058 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 46425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...