./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/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 7172975871b065518ca613924da6374ef1c35dee ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:16:36,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:16:36,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:16:36,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:16:36,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:16:36,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:16:36,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:16:36,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:16:36,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:16:36,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:16:36,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:16:36,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:16:36,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:16:36,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:16:36,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:16:36,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:16:36,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:16:36,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:16:36,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:16:36,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:16:36,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:16:36,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:16:36,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:16:36,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:16:36,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:16:36,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:16:36,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:16:36,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:16:36,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:16:36,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:16:36,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:16:36,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:16:36,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:16:36,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:16:36,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:16:36,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:16:36,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:16:36,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:16:36,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:16:36,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:16:36,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:16:36,932 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:16:36,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:16:36,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:16:36,943 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:16:36,943 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:16:36,944 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:16:36,944 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:16:36,945 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:16:36,945 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:16:36,945 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:16:36,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:16:36,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:16:36,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:16:36,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:16:36,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:16:36,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:16:36,947 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:16:36,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:16:36,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:16:36,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:16:36,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:16:36,948 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_6bc6686e-cb28-459c-9142-01aed35e3e9f/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 -> 7172975871b065518ca613924da6374ef1c35dee [2019-12-07 20:16:37,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:16:37,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:16:37,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:16:37,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:16:37,060 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:16:37,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix039_power.opt.i [2019-12-07 20:16:37,100 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/data/4d63f0cad/cfe54757ebfd4433b29ac420fe2c34f6/FLAGc5722c934 [2019-12-07 20:16:37,512 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:16:37,512 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/sv-benchmarks/c/pthread-wmm/mix039_power.opt.i [2019-12-07 20:16:37,522 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/data/4d63f0cad/cfe54757ebfd4433b29ac420fe2c34f6/FLAGc5722c934 [2019-12-07 20:16:37,898 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/data/4d63f0cad/cfe54757ebfd4433b29ac420fe2c34f6 [2019-12-07 20:16:37,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:16:37,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:16:37,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:16:37,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:16:37,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:16:37,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:16:37" (1/1) ... [2019-12-07 20:16:37,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296938c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:37, skipping insertion in model container [2019-12-07 20:16:37,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:16:37" (1/1) ... [2019-12-07 20:16:37,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:16:37,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:16:38,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:16:38,189 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:16:38,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:16:38,274 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:16:38,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38 WrapperNode [2019-12-07 20:16:38,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:16:38,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:16:38,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:16:38,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:16:38,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:16:38,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:16:38,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:16:38,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:16:38,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... [2019-12-07 20:16:38,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:16:38,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:16:38,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:16:38,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:16:38,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:16:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:16:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:16:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:16:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:16:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:16:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:16:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:16:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:16:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:16:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:16:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 20:16:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 20:16:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:16:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:16:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:16:38,377 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:16:38,717 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:16:38,717 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:16:38,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:16:38 BoogieIcfgContainer [2019-12-07 20:16:38,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:16:38,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:16:38,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:16:38,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:16:38,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:16:37" (1/3) ... [2019-12-07 20:16:38,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7295e22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:16:38, skipping insertion in model container [2019-12-07 20:16:38,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:16:38" (2/3) ... [2019-12-07 20:16:38,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7295e22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:16:38, skipping insertion in model container [2019-12-07 20:16:38,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:16:38" (3/3) ... [2019-12-07 20:16:38,723 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_power.opt.i [2019-12-07 20:16:38,729 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:16:38,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:16:38,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:16:38,734 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:16:38,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,759 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,770 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:16:38,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 20:16:38,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:16:38,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:16:38,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:16:38,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:16:38,798 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:16:38,798 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:16:38,798 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:16:38,798 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:16:38,809 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 20:16:38,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 20:16:38,862 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 20:16:38,862 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:16:38,871 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 20:16:38,882 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 20:16:38,908 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 20:16:38,908 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:16:38,912 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 20:16:38,923 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 20:16:38,924 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:16:41,800 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 20:16:42,045 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 20:16:42,149 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 20:16:42,149 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 20:16:42,151 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 20:16:43,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 20:16:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 20:16:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:16:43,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:43,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:43,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 20:16:43,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:43,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508433557] [2019-12-07 20:16:43,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:43,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508433557] [2019-12-07 20:16:43,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:43,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:16:43,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88933673] [2019-12-07 20:16:43,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:16:43,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:43,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:16:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:43,331 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 20:16:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:43,587 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 20:16:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:16:43,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:16:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:43,734 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 20:16:43,734 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 20:16:43,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 20:16:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 20:16:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 20:16:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 20:16:44,446 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 20:16:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:44,447 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 20:16:44,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:16:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 20:16:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:16:44,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:44,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:44,452 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 20:16:44,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:44,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403478443] [2019-12-07 20:16:44,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:44,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403478443] [2019-12-07 20:16:44,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:44,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:16:44,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194075302] [2019-12-07 20:16:44,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:16:44,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:16:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:16:44,514 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 20:16:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:44,841 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 20:16:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:16:44,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 20:16:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:45,031 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 20:16:45,031 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 20:16:45,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:16:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 20:16:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 20:16:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 20:16:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 20:16:45,669 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 20:16:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:45,669 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 20:16:45,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:16:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 20:16:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:16:45,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:45,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:45,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 20:16:45,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:45,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126154881] [2019-12-07 20:16:45,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:45,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126154881] [2019-12-07 20:16:45,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:45,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:16:45,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971662227] [2019-12-07 20:16:45,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:16:45,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:45,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:16:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:16:45,729 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 20:16:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:46,077 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 20:16:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:16:46,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 20:16:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:46,154 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 20:16:46,154 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 20:16:46,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:16:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 20:16:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 20:16:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 20:16:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 20:16:46,928 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 20:16:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:46,929 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 20:16:46,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:16:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 20:16:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:16:46,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:46,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:46,940 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 20:16:46,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:46,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079454409] [2019-12-07 20:16:46,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:47,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079454409] [2019-12-07 20:16:47,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:47,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:16:47,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108386715] [2019-12-07 20:16:47,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:16:47,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:16:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:47,002 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-07 20:16:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:47,127 INFO L93 Difference]: Finished difference Result 30378 states and 125828 transitions. [2019-12-07 20:16:47,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:16:47,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:16:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:47,198 INFO L225 Difference]: With dead ends: 30378 [2019-12-07 20:16:47,198 INFO L226 Difference]: Without dead ends: 30378 [2019-12-07 20:16:47,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30378 states. [2019-12-07 20:16:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30378 to 29978. [2019-12-07 20:16:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29978 states. [2019-12-07 20:16:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29978 states to 29978 states and 124268 transitions. [2019-12-07 20:16:47,791 INFO L78 Accepts]: Start accepts. Automaton has 29978 states and 124268 transitions. Word has length 20 [2019-12-07 20:16:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:47,791 INFO L462 AbstractCegarLoop]: Abstraction has 29978 states and 124268 transitions. [2019-12-07 20:16:47,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:16:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 29978 states and 124268 transitions. [2019-12-07 20:16:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:16:47,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:47,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:47,797 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:47,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:47,797 INFO L82 PathProgramCache]: Analyzing trace with hash -405590648, now seen corresponding path program 1 times [2019-12-07 20:16:47,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:47,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095461720] [2019-12-07 20:16:47,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:47,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 20:16:47,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095461720] [2019-12-07 20:16:47,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:47,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:16:47,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315612076] [2019-12-07 20:16:47,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:16:47,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:16:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:47,855 INFO L87 Difference]: Start difference. First operand 29978 states and 124268 transitions. Second operand 3 states. [2019-12-07 20:16:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:48,142 INFO L93 Difference]: Finished difference Result 44992 states and 177703 transitions. [2019-12-07 20:16:48,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:16:48,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:16:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:48,243 INFO L225 Difference]: With dead ends: 44992 [2019-12-07 20:16:48,243 INFO L226 Difference]: Without dead ends: 44408 [2019-12-07 20:16:48,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44408 states. [2019-12-07 20:16:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44408 to 43003. [2019-12-07 20:16:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43003 states. [2019-12-07 20:16:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43003 states to 43003 states and 171628 transitions. [2019-12-07 20:16:49,246 INFO L78 Accepts]: Start accepts. Automaton has 43003 states and 171628 transitions. Word has length 20 [2019-12-07 20:16:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:49,247 INFO L462 AbstractCegarLoop]: Abstraction has 43003 states and 171628 transitions. [2019-12-07 20:16:49,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:16:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 43003 states and 171628 transitions. [2019-12-07 20:16:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:16:49,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:49,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:49,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash -488858070, now seen corresponding path program 1 times [2019-12-07 20:16:49,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:49,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016849251] [2019-12-07 20:16:49,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:49,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016849251] [2019-12-07 20:16:49,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:49,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:16:49,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231645762] [2019-12-07 20:16:49,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:16:49,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:49,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:16:49,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:16:49,304 INFO L87 Difference]: Start difference. First operand 43003 states and 171628 transitions. Second operand 5 states. [2019-12-07 20:16:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:49,398 INFO L93 Difference]: Finished difference Result 19141 states and 63203 transitions. [2019-12-07 20:16:49,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:16:49,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 20:16:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:49,423 INFO L225 Difference]: With dead ends: 19141 [2019-12-07 20:16:49,423 INFO L226 Difference]: Without dead ends: 16563 [2019-12-07 20:16:49,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:16:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16563 states. [2019-12-07 20:16:49,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16563 to 16488. [2019-12-07 20:16:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16488 states. [2019-12-07 20:16:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16488 states to 16488 states and 53335 transitions. [2019-12-07 20:16:49,658 INFO L78 Accepts]: Start accepts. Automaton has 16488 states and 53335 transitions. Word has length 21 [2019-12-07 20:16:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:49,659 INFO L462 AbstractCegarLoop]: Abstraction has 16488 states and 53335 transitions. [2019-12-07 20:16:49,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:16:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16488 states and 53335 transitions. [2019-12-07 20:16:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:16:49,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:49,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:49,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash -914590498, now seen corresponding path program 1 times [2019-12-07 20:16:49,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:49,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260956182] [2019-12-07 20:16:49,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:49,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260956182] [2019-12-07 20:16:49,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:49,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:16:49,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171720456] [2019-12-07 20:16:49,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:16:49,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:16:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:16:49,714 INFO L87 Difference]: Start difference. First operand 16488 states and 53335 transitions. Second operand 6 states. [2019-12-07 20:16:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:49,774 INFO L93 Difference]: Finished difference Result 4973 states and 14692 transitions. [2019-12-07 20:16:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:16:49,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 20:16:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:49,779 INFO L225 Difference]: With dead ends: 4973 [2019-12-07 20:16:49,779 INFO L226 Difference]: Without dead ends: 3957 [2019-12-07 20:16:49,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:16:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3957 states. [2019-12-07 20:16:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3957 to 3525. [2019-12-07 20:16:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3525 states. [2019-12-07 20:16:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 10091 transitions. [2019-12-07 20:16:49,819 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 10091 transitions. Word has length 22 [2019-12-07 20:16:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:49,820 INFO L462 AbstractCegarLoop]: Abstraction has 3525 states and 10091 transitions. [2019-12-07 20:16:49,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:16:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 10091 transitions. [2019-12-07 20:16:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 20:16:49,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:49,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:49,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 20:16:49,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:49,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186701064] [2019-12-07 20:16:49,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:49,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186701064] [2019-12-07 20:16:49,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:49,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:16:49,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852781991] [2019-12-07 20:16:49,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:16:49,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:49,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:16:49,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:49,847 INFO L87 Difference]: Start difference. First operand 3525 states and 10091 transitions. Second operand 3 states. [2019-12-07 20:16:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:49,888 INFO L93 Difference]: Finished difference Result 5322 states and 15166 transitions. [2019-12-07 20:16:49,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:16:49,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 20:16:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:49,893 INFO L225 Difference]: With dead ends: 5322 [2019-12-07 20:16:49,894 INFO L226 Difference]: Without dead ends: 5322 [2019-12-07 20:16:49,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-12-07 20:16:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4193. [2019-12-07 20:16:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4193 states. [2019-12-07 20:16:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4193 states to 4193 states and 12146 transitions. [2019-12-07 20:16:49,945 INFO L78 Accepts]: Start accepts. Automaton has 4193 states and 12146 transitions. Word has length 32 [2019-12-07 20:16:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:49,945 INFO L462 AbstractCegarLoop]: Abstraction has 4193 states and 12146 transitions. [2019-12-07 20:16:49,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:16:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4193 states and 12146 transitions. [2019-12-07 20:16:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 20:16:49,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:49,950 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] [2019-12-07 20:16:49,950 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 20:16:49,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:49,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189171874] [2019-12-07 20:16:49,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:50,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189171874] [2019-12-07 20:16:50,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:50,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:16:50,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472990410] [2019-12-07 20:16:50,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:16:50,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:16:50,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:16:50,006 INFO L87 Difference]: Start difference. First operand 4193 states and 12146 transitions. Second operand 6 states. [2019-12-07 20:16:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:50,305 INFO L93 Difference]: Finished difference Result 8719 states and 24060 transitions. [2019-12-07 20:16:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:16:50,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 20:16:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:50,313 INFO L225 Difference]: With dead ends: 8719 [2019-12-07 20:16:50,313 INFO L226 Difference]: Without dead ends: 8715 [2019-12-07 20:16:50,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:16:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2019-12-07 20:16:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 4558. [2019-12-07 20:16:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4558 states. [2019-12-07 20:16:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 13123 transitions. [2019-12-07 20:16:50,375 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 13123 transitions. Word has length 32 [2019-12-07 20:16:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:50,376 INFO L462 AbstractCegarLoop]: Abstraction has 4558 states and 13123 transitions. [2019-12-07 20:16:50,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:16:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 13123 transitions. [2019-12-07 20:16:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:16:50,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:50,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:50,380 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 20:16:50,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:50,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883475381] [2019-12-07 20:16:50,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:50,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883475381] [2019-12-07 20:16:50,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:50,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:16:50,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727051822] [2019-12-07 20:16:50,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:16:50,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:50,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:16:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:16:50,441 INFO L87 Difference]: Start difference. First operand 4558 states and 13123 transitions. Second operand 6 states. [2019-12-07 20:16:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:50,721 INFO L93 Difference]: Finished difference Result 8478 states and 23247 transitions. [2019-12-07 20:16:50,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:16:50,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 20:16:50,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:50,734 INFO L225 Difference]: With dead ends: 8478 [2019-12-07 20:16:50,734 INFO L226 Difference]: Without dead ends: 8476 [2019-12-07 20:16:50,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:16:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states. [2019-12-07 20:16:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 4362. [2019-12-07 20:16:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4362 states. [2019-12-07 20:16:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 12641 transitions. [2019-12-07 20:16:50,826 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 12641 transitions. Word has length 33 [2019-12-07 20:16:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:50,826 INFO L462 AbstractCegarLoop]: Abstraction has 4362 states and 12641 transitions. [2019-12-07 20:16:50,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:16:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 12641 transitions. [2019-12-07 20:16:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:16:50,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:50,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:16:50,832 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:50,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:50,832 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-12-07 20:16:50,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:50,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852126754] [2019-12-07 20:16:50,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:50,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852126754] [2019-12-07 20:16:50,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:50,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:16:50,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066518797] [2019-12-07 20:16:50,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:16:50,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:16:50,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:16:50,898 INFO L87 Difference]: Start difference. First operand 4362 states and 12641 transitions. Second operand 7 states. [2019-12-07 20:16:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:50,993 INFO L93 Difference]: Finished difference Result 3076 states and 9503 transitions. [2019-12-07 20:16:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:16:50,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 20:16:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:50,997 INFO L225 Difference]: With dead ends: 3076 [2019-12-07 20:16:50,998 INFO L226 Difference]: Without dead ends: 2902 [2019-12-07 20:16:50,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:16:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2019-12-07 20:16:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2322. [2019-12-07 20:16:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-12-07 20:16:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 7569 transitions. [2019-12-07 20:16:51,036 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 7569 transitions. Word has length 33 [2019-12-07 20:16:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:51,036 INFO L462 AbstractCegarLoop]: Abstraction has 2322 states and 7569 transitions. [2019-12-07 20:16:51,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:16:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 7569 transitions. [2019-12-07 20:16:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:51,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:51,040 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] [2019-12-07 20:16:51,040 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-12-07 20:16:51,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:51,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179568128] [2019-12-07 20:16:51,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:51,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 20:16:51,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179568128] [2019-12-07 20:16:51,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:51,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:16:51,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744891344] [2019-12-07 20:16:51,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:16:51,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:16:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:16:51,126 INFO L87 Difference]: Start difference. First operand 2322 states and 7569 transitions. Second operand 6 states. [2019-12-07 20:16:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:51,360 INFO L93 Difference]: Finished difference Result 9292 states and 28724 transitions. [2019-12-07 20:16:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:16:51,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 20:16:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:51,369 INFO L225 Difference]: With dead ends: 9292 [2019-12-07 20:16:51,369 INFO L226 Difference]: Without dead ends: 7780 [2019-12-07 20:16:51,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:16:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2019-12-07 20:16:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 3194. [2019-12-07 20:16:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-12-07 20:16:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 10217 transitions. [2019-12-07 20:16:51,426 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 10217 transitions. Word has length 48 [2019-12-07 20:16:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:51,426 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 10217 transitions. [2019-12-07 20:16:51,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:16:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 10217 transitions. [2019-12-07 20:16:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:51,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:51,431 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] [2019-12-07 20:16:51,431 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -231356835, now seen corresponding path program 2 times [2019-12-07 20:16:51,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:51,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197655447] [2019-12-07 20:16:51,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:51,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197655447] [2019-12-07 20:16:51,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:51,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:16:51,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106840293] [2019-12-07 20:16:51,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:16:51,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:16:51,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:16:51,507 INFO L87 Difference]: Start difference. First operand 3194 states and 10217 transitions. Second operand 5 states. [2019-12-07 20:16:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:51,556 INFO L93 Difference]: Finished difference Result 5780 states and 17362 transitions. [2019-12-07 20:16:51,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:16:51,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 20:16:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:51,561 INFO L225 Difference]: With dead ends: 5780 [2019-12-07 20:16:51,561 INFO L226 Difference]: Without dead ends: 4333 [2019-12-07 20:16:51,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:16:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2019-12-07 20:16:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 2918. [2019-12-07 20:16:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2918 states. [2019-12-07 20:16:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 9204 transitions. [2019-12-07 20:16:51,597 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 9204 transitions. Word has length 48 [2019-12-07 20:16:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:51,597 INFO L462 AbstractCegarLoop]: Abstraction has 2918 states and 9204 transitions. [2019-12-07 20:16:51,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:16:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 9204 transitions. [2019-12-07 20:16:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:51,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:51,601 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] [2019-12-07 20:16:51,601 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 3 times [2019-12-07 20:16:51,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:51,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945748453] [2019-12-07 20:16:51,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:51,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945748453] [2019-12-07 20:16:51,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:51,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 20:16:51,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661136957] [2019-12-07 20:16:51,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:16:51,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:51,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:16:51,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:16:51,815 INFO L87 Difference]: Start difference. First operand 2918 states and 9204 transitions. Second operand 12 states. [2019-12-07 20:16:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:52,766 INFO L93 Difference]: Finished difference Result 5699 states and 16429 transitions. [2019-12-07 20:16:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 20:16:52,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 20:16:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:52,771 INFO L225 Difference]: With dead ends: 5699 [2019-12-07 20:16:52,771 INFO L226 Difference]: Without dead ends: 5630 [2019-12-07 20:16:52,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-12-07 20:16:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2019-12-07 20:16:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 2941. [2019-12-07 20:16:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2941 states. [2019-12-07 20:16:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 9275 transitions. [2019-12-07 20:16:52,812 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 9275 transitions. Word has length 48 [2019-12-07 20:16:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:52,812 INFO L462 AbstractCegarLoop]: Abstraction has 2941 states and 9275 transitions. [2019-12-07 20:16:52,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:16:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 9275 transitions. [2019-12-07 20:16:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:52,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:52,815 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] [2019-12-07 20:16:52,816 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:52,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:52,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1317469255, now seen corresponding path program 4 times [2019-12-07 20:16:52,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:52,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55407918] [2019-12-07 20:16:52,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:52,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55407918] [2019-12-07 20:16:52,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:52,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:16:52,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943114216] [2019-12-07 20:16:52,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:16:52,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:52,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:16:52,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:16:52,925 INFO L87 Difference]: Start difference. First operand 2941 states and 9275 transitions. Second operand 9 states. [2019-12-07 20:16:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:54,185 INFO L93 Difference]: Finished difference Result 16918 states and 49479 transitions. [2019-12-07 20:16:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 20:16:54,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-12-07 20:16:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:54,202 INFO L225 Difference]: With dead ends: 16918 [2019-12-07 20:16:54,202 INFO L226 Difference]: Without dead ends: 16516 [2019-12-07 20:16:54,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=478, Invalid=1592, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 20:16:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16516 states. [2019-12-07 20:16:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16516 to 3148. [2019-12-07 20:16:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-12-07 20:16:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 10094 transitions. [2019-12-07 20:16:54,317 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 10094 transitions. Word has length 48 [2019-12-07 20:16:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:54,317 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 10094 transitions. [2019-12-07 20:16:54,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:16:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 10094 transitions. [2019-12-07 20:16:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:54,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:54,322 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] [2019-12-07 20:16:54,322 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:54,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1933491589, now seen corresponding path program 1 times [2019-12-07 20:16:54,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:54,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329442166] [2019-12-07 20:16:54,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:54,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329442166] [2019-12-07 20:16:54,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:54,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:16:54,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661509758] [2019-12-07 20:16:54,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:16:54,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:16:54,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:54,346 INFO L87 Difference]: Start difference. First operand 3148 states and 10094 transitions. Second operand 3 states. [2019-12-07 20:16:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:54,372 INFO L93 Difference]: Finished difference Result 3594 states and 10987 transitions. [2019-12-07 20:16:54,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:16:54,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 20:16:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:54,376 INFO L225 Difference]: With dead ends: 3594 [2019-12-07 20:16:54,376 INFO L226 Difference]: Without dead ends: 3562 [2019-12-07 20:16:54,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:16:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2019-12-07 20:16:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3002. [2019-12-07 20:16:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3002 states. [2019-12-07 20:16:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 9417 transitions. [2019-12-07 20:16:54,409 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 9417 transitions. Word has length 48 [2019-12-07 20:16:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:54,409 INFO L462 AbstractCegarLoop]: Abstraction has 3002 states and 9417 transitions. [2019-12-07 20:16:54,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:16:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 9417 transitions. [2019-12-07 20:16:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:54,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:54,413 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] [2019-12-07 20:16:54,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:54,413 INFO L82 PathProgramCache]: Analyzing trace with hash -576774001, now seen corresponding path program 5 times [2019-12-07 20:16:54,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:54,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281009426] [2019-12-07 20:16:54,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:54,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281009426] [2019-12-07 20:16:54,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:54,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:16:54,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85080970] [2019-12-07 20:16:54,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:16:54,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:16:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:16:54,471 INFO L87 Difference]: Start difference. First operand 3002 states and 9417 transitions. Second operand 5 states. [2019-12-07 20:16:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:54,511 INFO L93 Difference]: Finished difference Result 4888 states and 14302 transitions. [2019-12-07 20:16:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:16:54,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 20:16:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:54,513 INFO L225 Difference]: With dead ends: 4888 [2019-12-07 20:16:54,513 INFO L226 Difference]: Without dead ends: 2045 [2019-12-07 20:16:54,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:16:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2019-12-07 20:16:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1637. [2019-12-07 20:16:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-12-07 20:16:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 4633 transitions. [2019-12-07 20:16:54,530 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 4633 transitions. Word has length 48 [2019-12-07 20:16:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:54,530 INFO L462 AbstractCegarLoop]: Abstraction has 1637 states and 4633 transitions. [2019-12-07 20:16:54,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:16:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 4633 transitions. [2019-12-07 20:16:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:54,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:54,532 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] [2019-12-07 20:16:54,532 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:54,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 6 times [2019-12-07 20:16:54,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:54,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486741353] [2019-12-07 20:16:54,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:54,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486741353] [2019-12-07 20:16:54,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:54,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:16:54,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422532468] [2019-12-07 20:16:54,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:16:54,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:54,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:16:54,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:16:54,588 INFO L87 Difference]: Start difference. First operand 1637 states and 4633 transitions. Second operand 4 states. [2019-12-07 20:16:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:54,608 INFO L93 Difference]: Finished difference Result 2070 states and 5595 transitions. [2019-12-07 20:16:54,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:16:54,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 20:16:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:54,609 INFO L225 Difference]: With dead ends: 2070 [2019-12-07 20:16:54,609 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 20:16:54,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:16:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 20:16:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-07 20:16:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 20:16:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1047 transitions. [2019-12-07 20:16:54,615 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1047 transitions. Word has length 48 [2019-12-07 20:16:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:54,615 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1047 transitions. [2019-12-07 20:16:54,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:16:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1047 transitions. [2019-12-07 20:16:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:54,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:54,617 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] [2019-12-07 20:16:54,617 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 7 times [2019-12-07 20:16:54,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:54,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780854558] [2019-12-07 20:16:54,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:16:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:16:54,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780854558] [2019-12-07 20:16:54,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:16:54,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 20:16:54,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848930228] [2019-12-07 20:16:54,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:16:54,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:16:54,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:16:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:16:54,827 INFO L87 Difference]: Start difference. First operand 481 states and 1047 transitions. Second operand 13 states. [2019-12-07 20:16:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:16:55,644 INFO L93 Difference]: Finished difference Result 979 states and 2087 transitions. [2019-12-07 20:16:55,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 20:16:55,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-12-07 20:16:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:16:55,645 INFO L225 Difference]: With dead ends: 979 [2019-12-07 20:16:55,645 INFO L226 Difference]: Without dead ends: 871 [2019-12-07 20:16:55,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:16:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-12-07 20:16:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 529. [2019-12-07 20:16:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-07 20:16:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1153 transitions. [2019-12-07 20:16:55,651 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1153 transitions. Word has length 48 [2019-12-07 20:16:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:16:55,651 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1153 transitions. [2019-12-07 20:16:55,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:16:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1153 transitions. [2019-12-07 20:16:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 20:16:55,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:16:55,652 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] [2019-12-07 20:16:55,652 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:16:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:16:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 8 times [2019-12-07 20:16:55,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:16:55,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160079921] [2019-12-07 20:16:55,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:16:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:16:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:16:55,735 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:16:55,735 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:16:55,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71| 1)) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_43|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71|) 0) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_71|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71|) |v_ULTIMATE.start_main_~#t1029~0.offset_43| 0)) |v_#memory_int_27|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1029~0.base_71| 4)) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_41|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_71|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_24|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_68|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_36|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:16:55,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-07 20:16:55,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:16:55,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-07 20:16:55,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-582343323 ~__unbuffered_p3_EAX~0_Out-582343323) (= ~a~0_Out-582343323 1) (= ~__unbuffered_p3_EBX~0_Out-582343323 ~b~0_In-582343323) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323)) (= ~z$r_buff0_thd4~0_Out-582343323 1) (= ~z$r_buff0_thd0~0_In-582343323 ~z$r_buff1_thd0~0_Out-582343323) (= ~z$r_buff0_thd4~0_In-582343323 ~z$r_buff1_thd4~0_Out-582343323) (= ~z$r_buff1_thd2~0_Out-582343323 ~z$r_buff0_thd2~0_In-582343323) (= ~z$r_buff1_thd1~0_Out-582343323 ~z$r_buff0_thd1~0_In-582343323) (= ~z$r_buff1_thd3~0_Out-582343323 ~z$r_buff0_thd3~0_In-582343323)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-582343323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-582343323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-582343323, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-582343323, ~a~0=~a~0_Out-582343323, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-582343323, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-582343323, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 20:16:55,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 20:16:55,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 20:16:55,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In733469695 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite8_In733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In733469695 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In733469695 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In733469695 256))) (= (mod ~z$w_buff0_used~0_In733469695 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In733469695|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out733469695|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out733469695|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 20:16:55,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2140763264 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2140763264 256)))) (or (= (mod ~z$w_buff0_used~0_In-2140763264 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-2140763264 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-2140763264 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite12_Out-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite12_Out-2140763264|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-2140763264|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:16:55,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1701741168 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1701741168 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1701741168 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1701741168 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1701741168 256))))) .cse1 (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite14_In-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite15_Out-1701741168|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1701741168|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 20:16:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 20:16:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-489179615 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-489179615 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-489179615 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-489179615 256))) (= (mod ~z$w_buff0_used~0_In-489179615 256) 0))) (= ~z$r_buff1_thd3~0_In-489179615 |P2Thread1of1ForFork1_#t~ite23_Out-489179615|) (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| ~z$r_buff1_thd3~0_In-489179615) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-489179615|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 20:16:55,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 20:16:55,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1574994956 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1574994956 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1574994956 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1574994956|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 20:16:55,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1210292619 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1210292619 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1210292619 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1210292619|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 20:16:55,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In101925086 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_In101925086 ~z$r_buff0_thd4~0_Out101925086)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In101925086 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out101925086) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In101925086} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out101925086, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out101925086|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 20:16:55,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 20:16:55,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 20:16:55,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:16:55,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-60958231 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-60958231 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-60958231| |ULTIMATE.start_main_#t~ite36_Out-60958231|))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z$w_buff1~0_In-60958231) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z~0_In-60958231) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ~z~0=~z~0_In-60958231} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-60958231|, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-60958231|, ~z~0=~z~0_In-60958231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 20:16:55,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In908169825 |ULTIMATE.start_main_#t~ite38_Out908169825|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out908169825| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out908169825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 20:16:55,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In203778712 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In203778712 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In203778712 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In203778712 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| ~z$w_buff1_used~0_In203778712) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out203778712|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 20:16:55,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1762638813 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1762638813 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| ~z$r_buff0_thd0~0_In1762638813) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1762638813|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:16:55,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256)))) (or (and (= ~z$r_buff1_thd0~0_In2096769610 |ULTIMATE.start_main_#t~ite41_Out2096769610|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out2096769610| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2096769610|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 20:16:55,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:16:55,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:16:55 BasicIcfg [2019-12-07 20:16:55,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:16:55,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:16:55,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:16:55,813 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:16:55,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:16:38" (3/4) ... [2019-12-07 20:16:55,815 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:16:55,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71| 1)) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_43|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71|) 0) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_71|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71|) |v_ULTIMATE.start_main_~#t1029~0.offset_43| 0)) |v_#memory_int_27|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1029~0.base_71| 4)) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_41|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_71|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_24|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_68|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_36|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:16:55,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-07 20:16:55,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:16:55,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-07 20:16:55,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-582343323 ~__unbuffered_p3_EAX~0_Out-582343323) (= ~a~0_Out-582343323 1) (= ~__unbuffered_p3_EBX~0_Out-582343323 ~b~0_In-582343323) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323)) (= ~z$r_buff0_thd4~0_Out-582343323 1) (= ~z$r_buff0_thd0~0_In-582343323 ~z$r_buff1_thd0~0_Out-582343323) (= ~z$r_buff0_thd4~0_In-582343323 ~z$r_buff1_thd4~0_Out-582343323) (= ~z$r_buff1_thd2~0_Out-582343323 ~z$r_buff0_thd2~0_In-582343323) (= ~z$r_buff1_thd1~0_Out-582343323 ~z$r_buff0_thd1~0_In-582343323) (= ~z$r_buff1_thd3~0_Out-582343323 ~z$r_buff0_thd3~0_In-582343323)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-582343323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-582343323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-582343323, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-582343323, ~a~0=~a~0_Out-582343323, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-582343323, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-582343323, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 20:16:55,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 20:16:55,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 20:16:55,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In733469695 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite8_In733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In733469695 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In733469695 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In733469695 256))) (= (mod ~z$w_buff0_used~0_In733469695 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In733469695|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out733469695|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out733469695|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 20:16:55,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2140763264 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2140763264 256)))) (or (= (mod ~z$w_buff0_used~0_In-2140763264 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-2140763264 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-2140763264 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite12_Out-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite12_Out-2140763264|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-2140763264|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 20:16:55,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1701741168 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1701741168 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1701741168 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1701741168 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1701741168 256))))) .cse1 (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite14_In-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite15_Out-1701741168|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1701741168|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 20:16:55,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 20:16:55,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-489179615 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-489179615 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-489179615 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-489179615 256))) (= (mod ~z$w_buff0_used~0_In-489179615 256) 0))) (= ~z$r_buff1_thd3~0_In-489179615 |P2Thread1of1ForFork1_#t~ite23_Out-489179615|) (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| ~z$r_buff1_thd3~0_In-489179615) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-489179615|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 20:16:55,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 20:16:55,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1574994956 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1574994956 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1574994956 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1574994956|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 20:16:55,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1210292619 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1210292619 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1210292619 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1210292619|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 20:16:55,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In101925086 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_In101925086 ~z$r_buff0_thd4~0_Out101925086)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In101925086 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out101925086) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In101925086} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out101925086, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out101925086|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 20:16:55,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 20:16:55,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 20:16:55,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 20:16:55,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-60958231 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-60958231 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-60958231| |ULTIMATE.start_main_#t~ite36_Out-60958231|))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z$w_buff1~0_In-60958231) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z~0_In-60958231) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ~z~0=~z~0_In-60958231} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-60958231|, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-60958231|, ~z~0=~z~0_In-60958231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 20:16:55,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In908169825 |ULTIMATE.start_main_#t~ite38_Out908169825|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out908169825| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out908169825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 20:16:55,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In203778712 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In203778712 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In203778712 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In203778712 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| ~z$w_buff1_used~0_In203778712) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out203778712|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 20:16:55,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1762638813 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1762638813 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| ~z$r_buff0_thd0~0_In1762638813) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1762638813|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 20:16:55,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256)))) (or (and (= ~z$r_buff1_thd0~0_In2096769610 |ULTIMATE.start_main_#t~ite41_Out2096769610|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out2096769610| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2096769610|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 20:16:55,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:16:55,886 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6bc6686e-cb28-459c-9142-01aed35e3e9f/bin/utaipan/witness.graphml [2019-12-07 20:16:55,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:16:55,887 INFO L168 Benchmark]: Toolchain (without parser) took 17985.96 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 938.1 MB in the beginning and 1.4 GB in the end (delta: -507.1 MB). Peak memory consumption was 918.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:16:55,888 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:16:55,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:16:55,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:16:55,888 INFO L168 Benchmark]: Boogie Preprocessor took 24.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:16:55,889 INFO L168 Benchmark]: RCFGBuilder took 383.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:16:55,889 INFO L168 Benchmark]: TraceAbstraction took 17093.63 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 998.2 MB in the beginning and 1.5 GB in the end (delta: -483.1 MB). Peak memory consumption was 850.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:16:55,889 INFO L168 Benchmark]: Witness Printer took 73.50 ms. Allocated memory is still 2.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:16:55,891 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.36 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 383.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17093.63 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 998.2 MB in the beginning and 1.5 GB in the end (delta: -483.1 MB). Peak memory consumption was 850.2 MB. Max. memory is 11.5 GB. * Witness Printer took 73.50 ms. Allocated memory is still 2.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2768 SDtfs, 4294 SDslu, 6505 SDs, 0 SdLazy, 3401 SolverSat, 437 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43003occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 43160 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 205878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...