./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_tso.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_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f8b982d1b6278787b824b8b49b18740fcbdfa1a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:48:48,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:48:48,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:48:48,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:48:48,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:48:48,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:48:48,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:48:48,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:48:48,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:48:48,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:48:48,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:48:48,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:48:48,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:48:48,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:48:48,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:48:48,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:48:48,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:48:48,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:48:48,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:48:48,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:48:48,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:48:48,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:48:48,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:48:48,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:48:48,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:48:48,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:48:48,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:48:48,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:48:48,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:48:48,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:48:48,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:48:48,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:48:48,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:48:48,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:48:48,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:48:48,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:48:48,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:48:48,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:48:48,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:48:48,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:48:48,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:48:48,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:48:48,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:48:48,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:48:48,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:48:48,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:48:48,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:48:48,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:48:48,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:48:48,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:48:48,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:48:48,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:48:48,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer 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 -> Automizer 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 -> 8f8b982d1b6278787b824b8b49b18740fcbdfa1a [2019-12-07 15:48:48,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:48:48,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:48:48,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:48:48,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:48:48,192 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:48:48,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i [2019-12-07 15:48:48,230 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/data/95d048a9e/476c1217f2ba4819ad1ac503a13291e5/FLAG42fb93443 [2019-12-07 15:48:48,591 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:48:48,591 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i [2019-12-07 15:48:48,603 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/data/95d048a9e/476c1217f2ba4819ad1ac503a13291e5/FLAG42fb93443 [2019-12-07 15:48:48,612 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/data/95d048a9e/476c1217f2ba4819ad1ac503a13291e5 [2019-12-07 15:48:48,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:48:48,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:48:48,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:48,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:48:48,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:48:48,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:48" (1/1) ... [2019-12-07 15:48:48,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:48, skipping insertion in model container [2019-12-07 15:48:48,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:48" (1/1) ... [2019-12-07 15:48:48,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:48:48,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:48:48,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:48,941 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:48:48,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:49,036 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:48:49,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49 WrapperNode [2019-12-07 15:48:49,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:49,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:49,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:48:49,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:48:49,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:49,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:48:49,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:48:49,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:48:49,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... [2019-12-07 15:48:49,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:48:49,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:48:49,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:48:49,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:48:49,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/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 15:48:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:48:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:48:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:48:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:48:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:48:49,145 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 15:48:49,519 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:48:49,519 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:48:49,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:49 BoogieIcfgContainer [2019-12-07 15:48:49,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:48:49,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:48:49,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:48:49,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:48:49,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:48:48" (1/3) ... [2019-12-07 15:48:49,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9c5679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:48:49, skipping insertion in model container [2019-12-07 15:48:49,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:49" (2/3) ... [2019-12-07 15:48:49,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9c5679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:48:49, skipping insertion in model container [2019-12-07 15:48:49,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:49" (3/3) ... [2019-12-07 15:48:49,524 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_tso.opt.i [2019-12-07 15:48:49,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:48:49,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:48:49,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:48:49,536 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:48:49,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:48:49,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 15:48:49,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:48:49,612 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:48:49,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:48:49,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:48:49,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:48:49,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:48:49,612 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:48:49,612 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:48:49,623 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 15:48:49,624 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 15:48:49,690 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 15:48:49,690 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:48:49,702 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 15:48:49,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 15:48:49,761 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 15:48:49,762 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:48:49,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 15:48:49,793 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 15:48:49,793 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:48:52,586 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 15:48:52,765 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 15:48:52,857 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-12-07 15:48:52,857 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 15:48:52,859 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-12-07 15:48:53,978 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-12-07 15:48:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-12-07 15:48:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:48:53,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:53,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:48:53,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-12-07 15:48:53,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:53,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909972583] [2019-12-07 15:48:53,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:54,130 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 15:48:54,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909972583] [2019-12-07 15:48:54,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:54,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:48:54,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216199742] [2019-12-07 15:48:54,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:54,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:54,147 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-12-07 15:48:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:54,419 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-12-07 15:48:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:54,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 15:48:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:54,567 INFO L225 Difference]: With dead ends: 23438 [2019-12-07 15:48:54,567 INFO L226 Difference]: Without dead ends: 21828 [2019-12-07 15:48:54,568 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 15:48:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-12-07 15:48:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-12-07 15:48:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-12-07 15:48:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-12-07 15:48:55,479 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-12-07 15:48:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:55,480 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-12-07 15:48:55,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-12-07 15:48:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:48:55,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:55,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:55,483 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-12-07 15:48:55,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:55,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544779940] [2019-12-07 15:48:55,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:55,547 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 15:48:55,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544779940] [2019-12-07 15:48:55,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:55,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:48:55,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673839131] [2019-12-07 15:48:55,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:48:55,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:48:55,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:48:55,550 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-12-07 15:48:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:56,049 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-12-07 15:48:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:48:56,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:48:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:56,195 INFO L225 Difference]: With dead ends: 34804 [2019-12-07 15:48:56,196 INFO L226 Difference]: Without dead ends: 34788 [2019-12-07 15:48:56,196 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 15:48:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-07 15:48:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-12-07 15:48:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-12-07 15:48:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-12-07 15:48:57,103 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-12-07 15:48:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:57,103 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-12-07 15:48:57,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:48:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-12-07 15:48:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:48:57,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:57,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:57,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-12-07 15:48:57,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:57,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417370968] [2019-12-07 15:48:57,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:57,147 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 15:48:57,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417370968] [2019-12-07 15:48:57,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:57,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:48:57,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242844302] [2019-12-07 15:48:57,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:48:57,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:48:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:48:57,149 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 4 states. [2019-12-07 15:48:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:57,436 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-12-07 15:48:57,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:48:57,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:48:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:57,505 INFO L225 Difference]: With dead ends: 44062 [2019-12-07 15:48:57,506 INFO L226 Difference]: Without dead ends: 44047 [2019-12-07 15:48:57,506 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 15:48:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-12-07 15:48:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-12-07 15:48:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-12-07 15:48:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-12-07 15:48:58,435 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-12-07 15:48:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:58,436 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-12-07 15:48:58,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:48:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-12-07 15:48:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:48:58,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:58,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:58,439 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-12-07 15:48:58,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:58,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976380012] [2019-12-07 15:48:58,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:58,465 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 15:48:58,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976380012] [2019-12-07 15:48:58,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:58,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:58,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910436954] [2019-12-07 15:48:58,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:58,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:58,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:58,466 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 3 states. [2019-12-07 15:48:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:58,700 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-12-07 15:48:58,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:58,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 15:48:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:58,905 INFO L225 Difference]: With dead ends: 64200 [2019-12-07 15:48:58,906 INFO L226 Difference]: Without dead ends: 64200 [2019-12-07 15:48:58,906 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 15:48:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-12-07 15:49:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-12-07 15:49:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-12-07 15:49:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-12-07 15:49:00,119 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-12-07 15:49:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:00,120 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-12-07 15:49:00,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:49:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-12-07 15:49:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:49:00,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:00,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:00,124 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-12-07 15:49:00,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:00,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620431649] [2019-12-07 15:49:00,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:00,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620431649] [2019-12-07 15:49:00,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:00,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:00,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509884031] [2019-12-07 15:49:00,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:49:00,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:49:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:49:00,165 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 4 states. [2019-12-07 15:49:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:00,209 INFO L93 Difference]: Finished difference Result 9360 states and 25413 transitions. [2019-12-07 15:49:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:49:00,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 15:49:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:00,215 INFO L225 Difference]: With dead ends: 9360 [2019-12-07 15:49:00,215 INFO L226 Difference]: Without dead ends: 5784 [2019-12-07 15:49:00,216 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 15:49:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2019-12-07 15:49:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5784. [2019-12-07 15:49:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-12-07 15:49:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 13603 transitions. [2019-12-07 15:49:00,267 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 13603 transitions. Word has length 16 [2019-12-07 15:49:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:00,267 INFO L462 AbstractCegarLoop]: Abstraction has 5784 states and 13603 transitions. [2019-12-07 15:49:00,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:49:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 13603 transitions. [2019-12-07 15:49:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 15:49:00,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:00,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:00,268 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-12-07 15:49:00,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:00,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516840137] [2019-12-07 15:49:00,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:00,311 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 15:49:00,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516840137] [2019-12-07 15:49:00,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:00,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:49:00,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668505973] [2019-12-07 15:49:00,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:49:00,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:00,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:49:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:49:00,313 INFO L87 Difference]: Start difference. First operand 5784 states and 13603 transitions. Second operand 4 states. [2019-12-07 15:49:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:00,465 INFO L93 Difference]: Finished difference Result 7282 states and 16815 transitions. [2019-12-07 15:49:00,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:49:00,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 15:49:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:00,471 INFO L225 Difference]: With dead ends: 7282 [2019-12-07 15:49:00,471 INFO L226 Difference]: Without dead ends: 7254 [2019-12-07 15:49:00,471 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 15:49:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-12-07 15:49:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5763. [2019-12-07 15:49:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2019-12-07 15:49:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 13545 transitions. [2019-12-07 15:49:00,527 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 13545 transitions. Word has length 17 [2019-12-07 15:49:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:00,527 INFO L462 AbstractCegarLoop]: Abstraction has 5763 states and 13545 transitions. [2019-12-07 15:49:00,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:49:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 13545 transitions. [2019-12-07 15:49:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:49:00,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:00,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:00,530 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:00,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1652760743, now seen corresponding path program 1 times [2019-12-07 15:49:00,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:00,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888612229] [2019-12-07 15:49:00,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:00,573 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 15:49:00,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888612229] [2019-12-07 15:49:00,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:00,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:00,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385922221] [2019-12-07 15:49:00,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:49:00,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:49:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:49:00,575 INFO L87 Difference]: Start difference. First operand 5763 states and 13545 transitions. Second operand 5 states. [2019-12-07 15:49:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:00,824 INFO L93 Difference]: Finished difference Result 7869 states and 17987 transitions. [2019-12-07 15:49:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:49:00,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 15:49:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:00,831 INFO L225 Difference]: With dead ends: 7869 [2019-12-07 15:49:00,831 INFO L226 Difference]: Without dead ends: 7868 [2019-12-07 15:49:00,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:49:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-12-07 15:49:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7238. [2019-12-07 15:49:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-07 15:49:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 16736 transitions. [2019-12-07 15:49:00,901 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 16736 transitions. Word has length 28 [2019-12-07 15:49:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:00,901 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 16736 transitions. [2019-12-07 15:49:00,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:49:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 16736 transitions. [2019-12-07 15:49:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:49:00,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:00,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:00,906 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-12-07 15:49:00,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:00,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688568308] [2019-12-07 15:49:00,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:00,928 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 15:49:00,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688568308] [2019-12-07 15:49:00,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:00,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:00,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000690099] [2019-12-07 15:49:00,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:49:00,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:00,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:49:00,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:49:00,929 INFO L87 Difference]: Start difference. First operand 7238 states and 16736 transitions. Second operand 3 states. [2019-12-07 15:49:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:00,977 INFO L93 Difference]: Finished difference Result 7743 states and 16952 transitions. [2019-12-07 15:49:00,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:00,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 15:49:00,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:00,983 INFO L225 Difference]: With dead ends: 7743 [2019-12-07 15:49:00,983 INFO L226 Difference]: Without dead ends: 7743 [2019-12-07 15:49:00,983 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 15:49:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7743 states. [2019-12-07 15:49:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7743 to 7211. [2019-12-07 15:49:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-12-07 15:49:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 15844 transitions. [2019-12-07 15:49:01,052 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 15844 transitions. Word has length 31 [2019-12-07 15:49:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:01,052 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 15844 transitions. [2019-12-07 15:49:01,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:49:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 15844 transitions. [2019-12-07 15:49:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:49:01,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:01,056 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 15:49:01,057 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 525279466, now seen corresponding path program 1 times [2019-12-07 15:49:01,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:01,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786777372] [2019-12-07 15:49:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:01,099 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 15:49:01,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786777372] [2019-12-07 15:49:01,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:01,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:49:01,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80329613] [2019-12-07 15:49:01,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:49:01,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:49:01,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:49:01,101 INFO L87 Difference]: Start difference. First operand 7211 states and 15844 transitions. Second operand 3 states. [2019-12-07 15:49:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:01,122 INFO L93 Difference]: Finished difference Result 7211 states and 15694 transitions. [2019-12-07 15:49:01,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:01,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 15:49:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:01,129 INFO L225 Difference]: With dead ends: 7211 [2019-12-07 15:49:01,129 INFO L226 Difference]: Without dead ends: 7211 [2019-12-07 15:49:01,129 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 15:49:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7211 states. [2019-12-07 15:49:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7211 to 6970. [2019-12-07 15:49:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6970 states. [2019-12-07 15:49:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 15214 transitions. [2019-12-07 15:49:01,196 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 15214 transitions. Word has length 33 [2019-12-07 15:49:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:01,196 INFO L462 AbstractCegarLoop]: Abstraction has 6970 states and 15214 transitions. [2019-12-07 15:49:01,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:49:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 15214 transitions. [2019-12-07 15:49:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:49:01,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:01,200 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 15:49:01,201 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2074378418, now seen corresponding path program 1 times [2019-12-07 15:49:01,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:01,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968850831] [2019-12-07 15:49:01,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:01,256 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 15:49:01,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968850831] [2019-12-07 15:49:01,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:01,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:49:01,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739776285] [2019-12-07 15:49:01,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:49:01,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:49:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:49:01,257 INFO L87 Difference]: Start difference. First operand 6970 states and 15214 transitions. Second operand 4 states. [2019-12-07 15:49:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:01,287 INFO L93 Difference]: Finished difference Result 6864 states and 14986 transitions. [2019-12-07 15:49:01,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:01,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 15:49:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:01,293 INFO L225 Difference]: With dead ends: 6864 [2019-12-07 15:49:01,293 INFO L226 Difference]: Without dead ends: 6864 [2019-12-07 15:49:01,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 15:49:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6864 states. [2019-12-07 15:49:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6864 to 6864. [2019-12-07 15:49:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6864 states. [2019-12-07 15:49:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 14986 transitions. [2019-12-07 15:49:01,366 INFO L78 Accepts]: Start accepts. Automaton has 6864 states and 14986 transitions. Word has length 33 [2019-12-07 15:49:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:01,366 INFO L462 AbstractCegarLoop]: Abstraction has 6864 states and 14986 transitions. [2019-12-07 15:49:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:49:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6864 states and 14986 transitions. [2019-12-07 15:49:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:49:01,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:01,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:01,370 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1333269799, now seen corresponding path program 1 times [2019-12-07 15:49:01,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:01,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139672226] [2019-12-07 15:49:01,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:01,407 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 15:49:01,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139672226] [2019-12-07 15:49:01,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:01,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:01,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864102286] [2019-12-07 15:49:01,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:49:01,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:01,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:49:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:49:01,409 INFO L87 Difference]: Start difference. First operand 6864 states and 14986 transitions. Second operand 5 states. [2019-12-07 15:49:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:01,641 INFO L93 Difference]: Finished difference Result 7869 states and 16911 transitions. [2019-12-07 15:49:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:49:01,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 15:49:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:01,646 INFO L225 Difference]: With dead ends: 7869 [2019-12-07 15:49:01,646 INFO L226 Difference]: Without dead ends: 7868 [2019-12-07 15:49:01,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:49:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-12-07 15:49:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 6136. [2019-12-07 15:49:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6136 states. [2019-12-07 15:49:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 13512 transitions. [2019-12-07 15:49:01,702 INFO L78 Accepts]: Start accepts. Automaton has 6136 states and 13512 transitions. Word has length 34 [2019-12-07 15:49:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:01,702 INFO L462 AbstractCegarLoop]: Abstraction has 6136 states and 13512 transitions. [2019-12-07 15:49:01,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:49:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6136 states and 13512 transitions. [2019-12-07 15:49:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:49:01,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:01,708 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] [2019-12-07 15:49:01,708 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:01,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:01,708 INFO L82 PathProgramCache]: Analyzing trace with hash -73517057, now seen corresponding path program 1 times [2019-12-07 15:49:01,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:01,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599565966] [2019-12-07 15:49:01,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:01,767 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 15:49:01,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599565966] [2019-12-07 15:49:01,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:01,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:49:01,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764651977] [2019-12-07 15:49:01,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:49:01,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:49:01,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:49:01,768 INFO L87 Difference]: Start difference. First operand 6136 states and 13512 transitions. Second operand 5 states. [2019-12-07 15:49:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:01,812 INFO L93 Difference]: Finished difference Result 4007 states and 8920 transitions. [2019-12-07 15:49:01,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:49:01,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 15:49:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:01,816 INFO L225 Difference]: With dead ends: 4007 [2019-12-07 15:49:01,816 INFO L226 Difference]: Without dead ends: 3801 [2019-12-07 15:49:01,816 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 15:49:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-12-07 15:49:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3701. [2019-12-07 15:49:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3701 states. [2019-12-07 15:49:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 8291 transitions. [2019-12-07 15:49:01,861 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 8291 transitions. Word has length 42 [2019-12-07 15:49:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:01,861 INFO L462 AbstractCegarLoop]: Abstraction has 3701 states and 8291 transitions. [2019-12-07 15:49:01,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:49:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 8291 transitions. [2019-12-07 15:49:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:49:01,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:01,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:01,865 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash 879996346, now seen corresponding path program 1 times [2019-12-07 15:49:01,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:01,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694077562] [2019-12-07 15:49:01,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:02,063 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 15:49:02,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694077562] [2019-12-07 15:49:02,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:02,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 15:49:02,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063940016] [2019-12-07 15:49:02,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:49:02,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:02,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:49:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:49:02,064 INFO L87 Difference]: Start difference. First operand 3701 states and 8291 transitions. Second operand 9 states. [2019-12-07 15:49:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:02,857 INFO L93 Difference]: Finished difference Result 7389 states and 16094 transitions. [2019-12-07 15:49:02,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 15:49:02,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-07 15:49:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:02,862 INFO L225 Difference]: With dead ends: 7389 [2019-12-07 15:49:02,863 INFO L226 Difference]: Without dead ends: 6771 [2019-12-07 15:49:02,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:49:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2019-12-07 15:49:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 4630. [2019-12-07 15:49:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4630 states. [2019-12-07 15:49:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 10539 transitions. [2019-12-07 15:49:02,913 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 10539 transitions. Word has length 59 [2019-12-07 15:49:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:02,913 INFO L462 AbstractCegarLoop]: Abstraction has 4630 states and 10539 transitions. [2019-12-07 15:49:02,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:49:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 10539 transitions. [2019-12-07 15:49:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:49:02,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:02,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:02,918 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 30677052, now seen corresponding path program 2 times [2019-12-07 15:49:02,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:02,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449984224] [2019-12-07 15:49:02,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:03,130 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 15:49:03,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449984224] [2019-12-07 15:49:03,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:03,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 15:49:03,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039293123] [2019-12-07 15:49:03,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:49:03,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:03,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:49:03,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:49:03,131 INFO L87 Difference]: Start difference. First operand 4630 states and 10539 transitions. Second operand 13 states. [2019-12-07 15:49:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:04,124 INFO L93 Difference]: Finished difference Result 11483 states and 26007 transitions. [2019-12-07 15:49:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 15:49:04,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-07 15:49:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:04,132 INFO L225 Difference]: With dead ends: 11483 [2019-12-07 15:49:04,132 INFO L226 Difference]: Without dead ends: 10936 [2019-12-07 15:49:04,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2019-12-07 15:49:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10936 states. [2019-12-07 15:49:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10936 to 5809. [2019-12-07 15:49:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5809 states. [2019-12-07 15:49:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 13139 transitions. [2019-12-07 15:49:04,200 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 13139 transitions. Word has length 59 [2019-12-07 15:49:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:04,200 INFO L462 AbstractCegarLoop]: Abstraction has 5809 states and 13139 transitions. [2019-12-07 15:49:04,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:49:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 13139 transitions. [2019-12-07 15:49:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:49:04,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:04,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:04,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:04,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1998597780, now seen corresponding path program 3 times [2019-12-07 15:49:04,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:04,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448744697] [2019-12-07 15:49:04,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:04,279 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 15:49:04,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448744697] [2019-12-07 15:49:04,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:04,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:49:04,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683479755] [2019-12-07 15:49:04,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:49:04,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:04,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:49:04,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:49:04,281 INFO L87 Difference]: Start difference. First operand 5809 states and 13139 transitions. Second operand 4 states. [2019-12-07 15:49:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:04,418 INFO L93 Difference]: Finished difference Result 6092 states and 13475 transitions. [2019-12-07 15:49:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:49:04,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 15:49:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:04,422 INFO L225 Difference]: With dead ends: 6092 [2019-12-07 15:49:04,422 INFO L226 Difference]: Without dead ends: 6092 [2019-12-07 15:49:04,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 15:49:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2019-12-07 15:49:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 5986. [2019-12-07 15:49:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2019-12-07 15:49:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 13266 transitions. [2019-12-07 15:49:04,476 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 13266 transitions. Word has length 59 [2019-12-07 15:49:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:04,476 INFO L462 AbstractCegarLoop]: Abstraction has 5986 states and 13266 transitions. [2019-12-07 15:49:04,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:49:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 13266 transitions. [2019-12-07 15:49:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:49:04,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:04,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:04,483 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 610981762, now seen corresponding path program 4 times [2019-12-07 15:49:04,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:04,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058675047] [2019-12-07 15:49:04,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:04,541 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 15:49:04,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058675047] [2019-12-07 15:49:04,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:04,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:49:04,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511234962] [2019-12-07 15:49:04,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:49:04,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:49:04,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:49:04,543 INFO L87 Difference]: Start difference. First operand 5986 states and 13266 transitions. Second operand 5 states. [2019-12-07 15:49:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:04,575 INFO L93 Difference]: Finished difference Result 6412 states and 14141 transitions. [2019-12-07 15:49:04,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:49:04,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 15:49:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:04,575 INFO L225 Difference]: With dead ends: 6412 [2019-12-07 15:49:04,575 INFO L226 Difference]: Without dead ends: 507 [2019-12-07 15:49:04,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:49:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-07 15:49:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-12-07 15:49:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-07 15:49:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1028 transitions. [2019-12-07 15:49:04,580 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1028 transitions. Word has length 59 [2019-12-07 15:49:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:04,580 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1028 transitions. [2019-12-07 15:49:04,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:49:04,580 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1028 transitions. [2019-12-07 15:49:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 15:49:04,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:04,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:04,581 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1561092922, now seen corresponding path program 1 times [2019-12-07 15:49:04,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:04,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302826684] [2019-12-07 15:49:04,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:04,640 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 15:49:04,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302826684] [2019-12-07 15:49:04,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:04,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 15:49:04,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058691821] [2019-12-07 15:49:04,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:49:04,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:04,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:49:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:49:04,641 INFO L87 Difference]: Start difference. First operand 507 states and 1028 transitions. Second operand 8 states. [2019-12-07 15:49:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:04,779 INFO L93 Difference]: Finished difference Result 1034 states and 2101 transitions. [2019-12-07 15:49:04,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:49:04,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-07 15:49:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:04,780 INFO L225 Difference]: With dead ends: 1034 [2019-12-07 15:49:04,780 INFO L226 Difference]: Without dead ends: 727 [2019-12-07 15:49:04,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:49:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-12-07 15:49:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 573. [2019-12-07 15:49:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-07 15:49:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1143 transitions. [2019-12-07 15:49:04,785 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1143 transitions. Word has length 60 [2019-12-07 15:49:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:04,785 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1143 transitions. [2019-12-07 15:49:04,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:49:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1143 transitions. [2019-12-07 15:49:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 15:49:04,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:04,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:04,786 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 2 times [2019-12-07 15:49:04,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:04,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662143562] [2019-12-07 15:49:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:49:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:49:04,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:49:04,852 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:49:04,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34|) |v_ULTIMATE.start_main_~#t12~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t12~0.offset_24| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t12~0.base_34| 4) |v_#length_19|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t12~0.base_34|) (= v_~x$r_buff0_thd1~0_297 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34|) 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_18|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, ULTIMATE.start_main_~#t12~0.offset=|v_ULTIMATE.start_main_~#t12~0.offset_24|, #length=|v_#length_19|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t12~0.base=|v_ULTIMATE.start_main_~#t12~0.base_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t12~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t12~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:49:04,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t13~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t13~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t13~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12|) 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12|) |v_ULTIMATE.start_main_~#t13~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t13~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_10|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base] because there is no mapped edge [2019-12-07 15:49:04,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:49:04,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-354428916 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-354428916 256)))) (or (and (not .cse0) (= ~x$w_buff0~0_In-354428916 |P1Thread1of1ForFork1_#t~ite28_Out-354428916|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-354428916| ~x$w_buff1~0_In-354428916)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-354428916, ~x$w_buff1~0=~x$w_buff1~0_In-354428916, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-354428916, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-354428916} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-354428916, ~x$w_buff1~0=~x$w_buff1~0_In-354428916, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-354428916, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-354428916|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-354428916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 15:49:04,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 15:49:04,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:49:04,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1219005721 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~x$mem_tmp~0_In1219005721) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~x~0_In1219005721) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1219005721, ~x$mem_tmp~0=~x$mem_tmp~0_In1219005721, ~x~0=~x~0_In1219005721} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1219005721, ~x$mem_tmp~0=~x$mem_tmp~0_In1219005721, ~x~0=~x~0_In1219005721, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1219005721|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 15:49:04,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In457622257 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In457622257 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out457622257|)) (and (= ~x$w_buff0_used~0_In457622257 |P1Thread1of1ForFork1_#t~ite51_Out457622257|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In457622257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In457622257} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out457622257|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In457622257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In457622257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 15:49:04,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In132684391 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In132684391 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In132684391 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In132684391 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| ~x$w_buff1_used~0_In132684391) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In132684391, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In132684391, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In132684391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In132684391} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out132684391|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In132684391, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In132684391, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In132684391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In132684391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 15:49:04,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1145599133 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1145599133 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out1145599133 ~x$r_buff0_thd2~0_In1145599133))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1145599133 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1145599133, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145599133} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1145599133|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1145599133, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145599133} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:49:04,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1182433197 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1182433197 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1182433197 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1182433197 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out1182433197| 0)) (and (= ~x$r_buff1_thd2~0_In1182433197 |P1Thread1of1ForFork1_#t~ite54_Out1182433197|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1182433197, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1182433197, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1182433197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1182433197} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1182433197, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1182433197, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1182433197|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1182433197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1182433197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 15:49:04,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 15:49:04,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In433036405 256)))) (or (and (= ~x~0_In433036405 |P0Thread1of1ForFork0_#t~ite25_Out433036405|) .cse0) (and (not .cse0) (= ~x$mem_tmp~0_In433036405 |P0Thread1of1ForFork0_#t~ite25_Out433036405|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In433036405, ~x$mem_tmp~0=~x$mem_tmp~0_In433036405, ~x~0=~x~0_In433036405} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out433036405|, ~x$flush_delayed~0=~x$flush_delayed~0_In433036405, ~x$mem_tmp~0=~x$mem_tmp~0_In433036405, ~x~0=~x~0_In433036405} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 15:49:04,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:49:04,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:49:04,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1096623333 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1096623333 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-1096623333| |ULTIMATE.start_main_#t~ite57_Out-1096623333|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-1096623333 |ULTIMATE.start_main_#t~ite57_Out-1096623333|)) (and (or .cse0 .cse2) (= ~x~0_In-1096623333 |ULTIMATE.start_main_#t~ite57_Out-1096623333|) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1096623333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1096623333, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1096623333, ~x~0=~x~0_In-1096623333} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1096623333, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1096623333|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1096623333|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1096623333, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1096623333, ~x~0=~x~0_In-1096623333} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 15:49:04,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1544137439 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1544137439 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1544137439 |ULTIMATE.start_main_#t~ite59_Out-1544137439|)) (and (= 0 |ULTIMATE.start_main_#t~ite59_Out-1544137439|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1544137439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1544137439} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1544137439, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1544137439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1544137439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:49:04,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In2127713832 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2127713832 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2127713832 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In2127713832 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2127713832 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2127713832, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127713832, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2127713832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127713832} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2127713832, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2127713832|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127713832, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2127713832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127713832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 15:49:04,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-825844460 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-825844460 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-825844460 |ULTIMATE.start_main_#t~ite61_Out-825844460|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-825844460|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-825844460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-825844460} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-825844460, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-825844460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-825844460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:49:04,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2100390433 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2100390433 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2100390433 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2100390433 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-2100390433| ~x$r_buff1_thd0~0_In-2100390433) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-2100390433| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2100390433, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2100390433, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2100390433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2100390433} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2100390433|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2100390433, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2100390433, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2100390433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2100390433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:49:04,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:49:04,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:49:04 BasicIcfg [2019-12-07 15:49:04,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:49:04,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:49:04,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:49:04,914 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:49:04,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:49" (3/4) ... [2019-12-07 15:49:04,916 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:49:04,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t12~0.base_34|) |v_ULTIMATE.start_main_~#t12~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= v_~__unbuffered_p1_EBX~0_50 0) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t12~0.offset_24| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34| 1)) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t12~0.base_34| 4) |v_#length_19|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_438) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t12~0.base_34|) (= v_~x$r_buff0_thd1~0_297 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t12~0.base_34|) 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_18|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, ULTIMATE.start_main_~#t12~0.offset=|v_ULTIMATE.start_main_~#t12~0.offset_24|, #length=|v_#length_19|, ~y~0=v_~y~0_47, ULTIMATE.start_main_~#t12~0.base=|v_ULTIMATE.start_main_~#t12~0.base_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t12~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t12~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:49:04,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t13~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t13~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t13~0.base_12| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t13~0.base_12|) 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t13~0.base_12|) |v_ULTIMATE.start_main_~#t13~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t13~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t13~0.offset=|v_ULTIMATE.start_main_~#t13~0.offset_10|, ULTIMATE.start_main_~#t13~0.base=|v_ULTIMATE.start_main_~#t13~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t13~0.offset, ULTIMATE.start_main_~#t13~0.base] because there is no mapped edge [2019-12-07 15:49:04,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:49:04,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-354428916 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-354428916 256)))) (or (and (not .cse0) (= ~x$w_buff0~0_In-354428916 |P1Thread1of1ForFork1_#t~ite28_Out-354428916|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-354428916| ~x$w_buff1~0_In-354428916)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-354428916, ~x$w_buff1~0=~x$w_buff1~0_In-354428916, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-354428916, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-354428916} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-354428916, ~x$w_buff1~0=~x$w_buff1~0_In-354428916, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-354428916, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-354428916|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-354428916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 15:49:04,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 15:49:04,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:49:04,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1219005721 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~x$mem_tmp~0_In1219005721) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1219005721| ~x~0_In1219005721) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1219005721, ~x$mem_tmp~0=~x$mem_tmp~0_In1219005721, ~x~0=~x~0_In1219005721} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1219005721, ~x$mem_tmp~0=~x$mem_tmp~0_In1219005721, ~x~0=~x~0_In1219005721, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1219005721|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 15:49:04,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In457622257 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In457622257 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out457622257|)) (and (= ~x$w_buff0_used~0_In457622257 |P1Thread1of1ForFork1_#t~ite51_Out457622257|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In457622257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In457622257} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out457622257|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In457622257, ~x$w_buff0_used~0=~x$w_buff0_used~0_In457622257} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 15:49:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In132684391 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In132684391 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In132684391 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In132684391 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite52_Out132684391| ~x$w_buff1_used~0_In132684391) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In132684391, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In132684391, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In132684391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In132684391} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out132684391|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In132684391, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In132684391, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In132684391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In132684391} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 15:49:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1145599133 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1145599133 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out1145599133 ~x$r_buff0_thd2~0_In1145599133))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out1145599133 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1145599133, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145599133} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1145599133|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1145599133, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1145599133} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:49:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1182433197 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1182433197 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1182433197 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1182433197 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out1182433197| 0)) (and (= ~x$r_buff1_thd2~0_In1182433197 |P1Thread1of1ForFork1_#t~ite54_Out1182433197|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1182433197, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1182433197, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1182433197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1182433197} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1182433197, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1182433197, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1182433197|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1182433197, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1182433197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 15:49:04,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 15:49:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In433036405 256)))) (or (and (= ~x~0_In433036405 |P0Thread1of1ForFork0_#t~ite25_Out433036405|) .cse0) (and (not .cse0) (= ~x$mem_tmp~0_In433036405 |P0Thread1of1ForFork0_#t~ite25_Out433036405|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In433036405, ~x$mem_tmp~0=~x$mem_tmp~0_In433036405, ~x~0=~x~0_In433036405} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out433036405|, ~x$flush_delayed~0=~x$flush_delayed~0_In433036405, ~x$mem_tmp~0=~x$mem_tmp~0_In433036405, ~x~0=~x~0_In433036405} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 15:49:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:49:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:49:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1096623333 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1096623333 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-1096623333| |ULTIMATE.start_main_#t~ite57_Out-1096623333|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-1096623333 |ULTIMATE.start_main_#t~ite57_Out-1096623333|)) (and (or .cse0 .cse2) (= ~x~0_In-1096623333 |ULTIMATE.start_main_#t~ite57_Out-1096623333|) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1096623333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1096623333, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1096623333, ~x~0=~x~0_In-1096623333} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1096623333, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1096623333|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1096623333|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1096623333, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1096623333, ~x~0=~x~0_In-1096623333} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 15:49:04,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1544137439 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1544137439 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1544137439 |ULTIMATE.start_main_#t~ite59_Out-1544137439|)) (and (= 0 |ULTIMATE.start_main_#t~ite59_Out-1544137439|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1544137439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1544137439} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1544137439, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1544137439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1544137439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:49:04,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In2127713832 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2127713832 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2127713832 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In2127713832 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2127713832 |ULTIMATE.start_main_#t~ite60_Out2127713832|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2127713832, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127713832, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2127713832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127713832} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2127713832, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2127713832|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2127713832, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2127713832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2127713832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 15:49:04,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-825844460 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-825844460 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-825844460 |ULTIMATE.start_main_#t~ite61_Out-825844460|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-825844460|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-825844460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-825844460} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-825844460, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-825844460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-825844460} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:49:04,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2100390433 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2100390433 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2100390433 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2100390433 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-2100390433| ~x$r_buff1_thd0~0_In-2100390433) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-2100390433| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2100390433, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2100390433, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2100390433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2100390433} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2100390433|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2100390433, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2100390433, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2100390433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2100390433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:49:04,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:49:04,984 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_accff245-f7aa-4b37-9b29-d307a9fa1c38/bin/uautomizer/witness.graphml [2019-12-07 15:49:04,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:49:04,985 INFO L168 Benchmark]: Toolchain (without parser) took 16370.38 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 938.1 MB in the beginning and 1.5 GB in the end (delta: -515.3 MB). Peak memory consumption was 655.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:49:04,985 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:49:04,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:49:04,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.55 ms. Allocated memory is still 1.2 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 15:49:04,986 INFO L168 Benchmark]: Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.2 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 15:49:04,986 INFO L168 Benchmark]: RCFGBuilder took 418.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:49:04,986 INFO L168 Benchmark]: TraceAbstraction took 15393.43 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -439.9 MB). Peak memory consumption was 588.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:49:04,987 INFO L168 Benchmark]: Witness Printer took 69.61 ms. Allocated memory is still 2.2 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:49:04,988 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15393.43 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -439.9 MB). Peak memory consumption was 588.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.61 ms. Allocated memory is still 2.2 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t12, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t13, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3629 SDtfs, 4394 SDslu, 7392 SDs, 0 SdLazy, 3728 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57180occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 24923 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 136570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...