./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_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_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/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 2783461bf06c366108165e274673df7c39b88457 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:21:11,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:21:11,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:21:11,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:21:11,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:21:11,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:21:11,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:21:11,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:21:11,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:21:11,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:21:11,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:21:11,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:21:11,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:21:11,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:21:11,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:21:11,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:21:11,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:21:11,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:21:11,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:21:11,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:21:11,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:21:11,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:21:11,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:21:11,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:21:11,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:21:11,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:21:11,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:21:11,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:21:11,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:21:11,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:21:11,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:21:11,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:21:11,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:21:11,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:21:11,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:21:11,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:21:11,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:21:11,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:21:11,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:21:11,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:21:11,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:21:11,315 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:21:11,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:21:11,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:21:11,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:21:11,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:21:11,326 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:21:11,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:21:11,326 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:21:11,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:21:11,327 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:21:11,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:21:11,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:21:11,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:21:11,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:21:11,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:21:11,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:21:11,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:21:11,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:21:11,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:21:11,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:21:11,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:21:11,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:21:11,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:21:11,329 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_16ed3415-f91a-42b1-a304-59d57646d6cf/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 -> 2783461bf06c366108165e274673df7c39b88457 [2019-12-07 10:21:11,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:21:11,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:21:11,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:21:11,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:21:11,441 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:21:11,442 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix009_tso.opt.i [2019-12-07 10:21:11,489 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/data/a57e5ba9b/84a89c67063d4e2c8ec8ecf69dbc6303/FLAGde9ae0684 [2019-12-07 10:21:11,851 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:21:11,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/sv-benchmarks/c/pthread-wmm/mix009_tso.opt.i [2019-12-07 10:21:11,861 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/data/a57e5ba9b/84a89c67063d4e2c8ec8ecf69dbc6303/FLAGde9ae0684 [2019-12-07 10:21:11,870 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/data/a57e5ba9b/84a89c67063d4e2c8ec8ecf69dbc6303 [2019-12-07 10:21:11,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:21:11,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:21:11,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:21:11,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:21:11,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:21:11,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:21:11" (1/1) ... [2019-12-07 10:21:11,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:11, skipping insertion in model container [2019-12-07 10:21:11,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:21:11" (1/1) ... [2019-12-07 10:21:11,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:21:11,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:21:12,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:21:12,180 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:21:12,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:21:12,269 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:21:12,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12 WrapperNode [2019-12-07 10:21:12,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:21:12,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:21:12,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:21:12,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:21:12,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:21:12,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:21:12,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:21:12,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:21:12,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... [2019-12-07 10:21:12,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:21:12,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:21:12,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:21:12,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:21:12,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/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 10:21:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:21:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:21:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:21:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:21:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:21:12,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:21:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:21:12,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:21:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:21:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:21:12,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:21:12,380 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 10:21:12,758 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:21:12,758 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:21:12,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:12 BoogieIcfgContainer [2019-12-07 10:21:12,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:21:12,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:21:12,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:21:12,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:21:12,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:21:11" (1/3) ... [2019-12-07 10:21:12,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406cb43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:21:12, skipping insertion in model container [2019-12-07 10:21:12,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:12" (2/3) ... [2019-12-07 10:21:12,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406cb43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:21:12, skipping insertion in model container [2019-12-07 10:21:12,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:12" (3/3) ... [2019-12-07 10:21:12,764 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_tso.opt.i [2019-12-07 10:21:12,770 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:21:12,770 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:21:12,775 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:21:12,775 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:21:12,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:12,840 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:21:12,852 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:21:12,852 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:21:12,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:21:12,852 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:21:12,852 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:21:12,852 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:21:12,852 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:21:12,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:21:12,863 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 229 transitions [2019-12-07 10:21:12,865 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 229 transitions [2019-12-07 10:21:12,929 INFO L134 PetriNetUnfolder]: 56/227 cut-off events. [2019-12-07 10:21:12,929 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:21:12,941 INFO L76 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 56/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 912 event pairs. 6/175 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:21:12,962 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 229 transitions [2019-12-07 10:21:12,995 INFO L134 PetriNetUnfolder]: 56/227 cut-off events. [2019-12-07 10:21:12,995 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:21:13,001 INFO L76 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 56/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 912 event pairs. 6/175 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:21:13,022 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 10:21:13,023 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:21:15,899 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 10:21:16,019 INFO L206 etLargeBlockEncoding]: Checked pairs total: 118733 [2019-12-07 10:21:16,019 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-07 10:21:16,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 123 transitions [2019-12-07 10:21:17,137 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22250 states. [2019-12-07 10:21:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22250 states. [2019-12-07 10:21:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:21:17,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:17,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:21:17,144 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 967970267, now seen corresponding path program 1 times [2019-12-07 10:21:17,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:17,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977223692] [2019-12-07 10:21:17,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:17,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977223692] [2019-12-07 10:21:17,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:17,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:21:17,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697300799] [2019-12-07 10:21:17,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:17,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:17,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:17,316 INFO L87 Difference]: Start difference. First operand 22250 states. Second operand 3 states. [2019-12-07 10:21:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:17,583 INFO L93 Difference]: Finished difference Result 22082 states and 78296 transitions. [2019-12-07 10:21:17,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:17,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:21:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:17,717 INFO L225 Difference]: With dead ends: 22082 [2019-12-07 10:21:17,717 INFO L226 Difference]: Without dead ends: 20570 [2019-12-07 10:21:17,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-12-07 10:21:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20570. [2019-12-07 10:21:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20570 states. [2019-12-07 10:21:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20570 states to 20570 states and 72872 transitions. [2019-12-07 10:21:18,516 INFO L78 Accepts]: Start accepts. Automaton has 20570 states and 72872 transitions. Word has length 5 [2019-12-07 10:21:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:18,516 INFO L462 AbstractCegarLoop]: Abstraction has 20570 states and 72872 transitions. [2019-12-07 10:21:18,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 20570 states and 72872 transitions. [2019-12-07 10:21:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:21:18,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:18,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:18,519 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash 488138773, now seen corresponding path program 1 times [2019-12-07 10:21:18,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:18,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921672065] [2019-12-07 10:21:18,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:18,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921672065] [2019-12-07 10:21:18,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:18,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:21:18,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535875503] [2019-12-07 10:21:18,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:21:18,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:18,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:21:18,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:18,589 INFO L87 Difference]: Start difference. First operand 20570 states and 72872 transitions. Second operand 4 states. [2019-12-07 10:21:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:18,952 INFO L93 Difference]: Finished difference Result 32746 states and 111276 transitions. [2019-12-07 10:21:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:21:18,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:21:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:19,021 INFO L225 Difference]: With dead ends: 32746 [2019-12-07 10:21:19,022 INFO L226 Difference]: Without dead ends: 32730 [2019-12-07 10:21:19,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:21:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32730 states. [2019-12-07 10:21:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32730 to 31357. [2019-12-07 10:21:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31357 states. [2019-12-07 10:21:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31357 states to 31357 states and 107493 transitions. [2019-12-07 10:21:19,875 INFO L78 Accepts]: Start accepts. Automaton has 31357 states and 107493 transitions. Word has length 11 [2019-12-07 10:21:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:19,876 INFO L462 AbstractCegarLoop]: Abstraction has 31357 states and 107493 transitions. [2019-12-07 10:21:19,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:21:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 31357 states and 107493 transitions. [2019-12-07 10:21:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:21:19,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:19,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:19,881 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:19,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash -708377534, now seen corresponding path program 1 times [2019-12-07 10:21:19,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:19,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431325527] [2019-12-07 10:21:19,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:19,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431325527] [2019-12-07 10:21:19,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:19,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:21:19,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531685477] [2019-12-07 10:21:19,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:21:19,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:19,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:21:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:19,946 INFO L87 Difference]: Start difference. First operand 31357 states and 107493 transitions. Second operand 4 states. [2019-12-07 10:21:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:20,365 INFO L93 Difference]: Finished difference Result 41141 states and 138603 transitions. [2019-12-07 10:21:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:21:20,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:21:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:20,433 INFO L225 Difference]: With dead ends: 41141 [2019-12-07 10:21:20,433 INFO L226 Difference]: Without dead ends: 41125 [2019-12-07 10:21:20,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:21:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41125 states. [2019-12-07 10:21:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41125 to 36115. [2019-12-07 10:21:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36115 states. [2019-12-07 10:21:21,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36115 states to 36115 states and 123093 transitions. [2019-12-07 10:21:21,328 INFO L78 Accepts]: Start accepts. Automaton has 36115 states and 123093 transitions. Word has length 14 [2019-12-07 10:21:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:21,328 INFO L462 AbstractCegarLoop]: Abstraction has 36115 states and 123093 transitions. [2019-12-07 10:21:21,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:21:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 36115 states and 123093 transitions. [2019-12-07 10:21:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:21:21,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:21,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:21,332 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash -484837769, now seen corresponding path program 1 times [2019-12-07 10:21:21,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:21,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455793004] [2019-12-07 10:21:21,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:21,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455793004] [2019-12-07 10:21:21,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:21,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:21:21,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483933139] [2019-12-07 10:21:21,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:21,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:21,357 INFO L87 Difference]: Start difference. First operand 36115 states and 123093 transitions. Second operand 3 states. [2019-12-07 10:21:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:21,571 INFO L93 Difference]: Finished difference Result 60120 states and 195578 transitions. [2019-12-07 10:21:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:21,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:21:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:21,673 INFO L225 Difference]: With dead ends: 60120 [2019-12-07 10:21:21,673 INFO L226 Difference]: Without dead ends: 60120 [2019-12-07 10:21:21,673 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 10:21:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60120 states. [2019-12-07 10:21:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60120 to 53845. [2019-12-07 10:21:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53845 states. [2019-12-07 10:21:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53845 states to 53845 states and 177890 transitions. [2019-12-07 10:21:22,912 INFO L78 Accepts]: Start accepts. Automaton has 53845 states and 177890 transitions. Word has length 15 [2019-12-07 10:21:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:22,912 INFO L462 AbstractCegarLoop]: Abstraction has 53845 states and 177890 transitions. [2019-12-07 10:21:22,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 53845 states and 177890 transitions. [2019-12-07 10:21:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:21:22,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:22,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:22,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -738389870, now seen corresponding path program 1 times [2019-12-07 10:21:22,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:22,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486445417] [2019-12-07 10:21:22,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:22,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486445417] [2019-12-07 10:21:22,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:22,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:21:22,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706577322] [2019-12-07 10:21:22,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:22,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:22,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:22,954 INFO L87 Difference]: Start difference. First operand 53845 states and 177890 transitions. Second operand 3 states. [2019-12-07 10:21:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:22,970 INFO L93 Difference]: Finished difference Result 5497 states and 12822 transitions. [2019-12-07 10:21:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:22,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:21:22,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:22,975 INFO L225 Difference]: With dead ends: 5497 [2019-12-07 10:21:22,975 INFO L226 Difference]: Without dead ends: 5497 [2019-12-07 10:21:22,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2019-12-07 10:21:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5497. [2019-12-07 10:21:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-12-07 10:21:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 12822 transitions. [2019-12-07 10:21:23,023 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 12822 transitions. Word has length 16 [2019-12-07 10:21:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:23,023 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 12822 transitions. [2019-12-07 10:21:23,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 12822 transitions. [2019-12-07 10:21:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:21:23,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:23,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:23,024 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash -884985628, now seen corresponding path program 1 times [2019-12-07 10:21:23,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:23,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283720837] [2019-12-07 10:21:23,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:23,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283720837] [2019-12-07 10:21:23,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:23,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:21:23,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084315386] [2019-12-07 10:21:23,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:21:23,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:21:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:23,071 INFO L87 Difference]: Start difference. First operand 5497 states and 12822 transitions. Second operand 4 states. [2019-12-07 10:21:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:23,268 INFO L93 Difference]: Finished difference Result 6995 states and 16059 transitions. [2019-12-07 10:21:23,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:21:23,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 10:21:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:23,274 INFO L225 Difference]: With dead ends: 6995 [2019-12-07 10:21:23,274 INFO L226 Difference]: Without dead ends: 6995 [2019-12-07 10:21:23,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:21:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-12-07 10:21:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 5527. [2019-12-07 10:21:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5527 states. [2019-12-07 10:21:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 12893 transitions. [2019-12-07 10:21:23,358 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 12893 transitions. Word has length 17 [2019-12-07 10:21:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:23,359 INFO L462 AbstractCegarLoop]: Abstraction has 5527 states and 12893 transitions. [2019-12-07 10:21:23,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:21:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 12893 transitions. [2019-12-07 10:21:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:21:23,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:23,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:21:23,362 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash 54448529, now seen corresponding path program 1 times [2019-12-07 10:21:23,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:23,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664345676] [2019-12-07 10:21:23,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:23,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664345676] [2019-12-07 10:21:23,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:23,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:21:23,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7359703] [2019-12-07 10:21:23,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:21:23,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:23,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:21:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:21:23,448 INFO L87 Difference]: Start difference. First operand 5527 states and 12893 transitions. Second operand 5 states. [2019-12-07 10:21:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:23,694 INFO L93 Difference]: Finished difference Result 7553 states and 17174 transitions. [2019-12-07 10:21:23,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:21:23,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:21:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:23,700 INFO L225 Difference]: With dead ends: 7553 [2019-12-07 10:21:23,700 INFO L226 Difference]: Without dead ends: 7552 [2019-12-07 10:21:23,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 10:21:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-07 10:21:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6894. [2019-12-07 10:21:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2019-12-07 10:21:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 15860 transitions. [2019-12-07 10:21:23,767 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 15860 transitions. Word has length 28 [2019-12-07 10:21:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:23,767 INFO L462 AbstractCegarLoop]: Abstraction has 6894 states and 15860 transitions. [2019-12-07 10:21:23,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:21:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 15860 transitions. [2019-12-07 10:21:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:21:23,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:23,772 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 10:21:23,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:23,772 INFO L82 PathProgramCache]: Analyzing trace with hash 68434611, now seen corresponding path program 1 times [2019-12-07 10:21:23,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:23,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495161177] [2019-12-07 10:21:23,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:23,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495161177] [2019-12-07 10:21:23,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:23,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:21:23,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007908618] [2019-12-07 10:21:23,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:23,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:23,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:23,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:23,794 INFO L87 Difference]: Start difference. First operand 6894 states and 15860 transitions. Second operand 3 states. [2019-12-07 10:21:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:23,842 INFO L93 Difference]: Finished difference Result 7389 states and 16044 transitions. [2019-12-07 10:21:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:23,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 10:21:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:23,847 INFO L225 Difference]: With dead ends: 7389 [2019-12-07 10:21:23,848 INFO L226 Difference]: Without dead ends: 7389 [2019-12-07 10:21:23,848 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 10:21:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2019-12-07 10:21:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 6866. [2019-12-07 10:21:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6866 states. [2019-12-07 10:21:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6866 states to 6866 states and 14981 transitions. [2019-12-07 10:21:23,911 INFO L78 Accepts]: Start accepts. Automaton has 6866 states and 14981 transitions. Word has length 31 [2019-12-07 10:21:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:23,912 INFO L462 AbstractCegarLoop]: Abstraction has 6866 states and 14981 transitions. [2019-12-07 10:21:23,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 6866 states and 14981 transitions. [2019-12-07 10:21:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:21:23,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:23,916 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 10:21:23,916 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 776643850, now seen corresponding path program 1 times [2019-12-07 10:21:23,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:23,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277998181] [2019-12-07 10:21:23,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:23,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277998181] [2019-12-07 10:21:23,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:23,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:21:23,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522362815] [2019-12-07 10:21:23,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:23,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:23,949 INFO L87 Difference]: Start difference. First operand 6866 states and 14981 transitions. Second operand 3 states. [2019-12-07 10:21:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:23,965 INFO L93 Difference]: Finished difference Result 6771 states and 14777 transitions. [2019-12-07 10:21:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:23,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 10:21:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:23,970 INFO L225 Difference]: With dead ends: 6771 [2019-12-07 10:21:23,970 INFO L226 Difference]: Without dead ends: 6771 [2019-12-07 10:21:23,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2019-12-07 10:21:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 6771. [2019-12-07 10:21:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6771 states. [2019-12-07 10:21:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 14777 transitions. [2019-12-07 10:21:24,032 INFO L78 Accepts]: Start accepts. Automaton has 6771 states and 14777 transitions. Word has length 33 [2019-12-07 10:21:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:24,032 INFO L462 AbstractCegarLoop]: Abstraction has 6771 states and 14777 transitions. [2019-12-07 10:21:24,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6771 states and 14777 transitions. [2019-12-07 10:21:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:21:24,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:24,037 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 10:21:24,037 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1341933323, now seen corresponding path program 1 times [2019-12-07 10:21:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:24,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641739216] [2019-12-07 10:21:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641739216] [2019-12-07 10:21:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:21:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520890566] [2019-12-07 10:21:24,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:21:24,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:21:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:24,068 INFO L87 Difference]: Start difference. First operand 6771 states and 14777 transitions. Second operand 4 states. [2019-12-07 10:21:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:24,085 INFO L93 Difference]: Finished difference Result 4322 states and 9332 transitions. [2019-12-07 10:21:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:21:24,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 10:21:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:24,088 INFO L225 Difference]: With dead ends: 4322 [2019-12-07 10:21:24,088 INFO L226 Difference]: Without dead ends: 4322 [2019-12-07 10:21:24,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-07 10:21:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3618. [2019-12-07 10:21:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-12-07 10:21:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 7976 transitions. [2019-12-07 10:21:24,125 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 7976 transitions. Word has length 34 [2019-12-07 10:21:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:24,125 INFO L462 AbstractCegarLoop]: Abstraction has 3618 states and 7976 transitions. [2019-12-07 10:21:24,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:21:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 7976 transitions. [2019-12-07 10:21:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:21:24,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:24,130 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] [2019-12-07 10:21:24,130 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:24,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1031189716, now seen corresponding path program 1 times [2019-12-07 10:21:24,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:24,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477297936] [2019-12-07 10:21:24,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:24,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477297936] [2019-12-07 10:21:24,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:24,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:21:24,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065083376] [2019-12-07 10:21:24,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:21:24,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:21:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:21:24,188 INFO L87 Difference]: Start difference. First operand 3618 states and 7976 transitions. Second operand 5 states. [2019-12-07 10:21:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:24,400 INFO L93 Difference]: Finished difference Result 4313 states and 9321 transitions. [2019-12-07 10:21:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:21:24,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 10:21:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:24,404 INFO L225 Difference]: With dead ends: 4313 [2019-12-07 10:21:24,404 INFO L226 Difference]: Without dead ends: 4313 [2019-12-07 10:21:24,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:21:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-07 10:21:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4049. [2019-12-07 10:21:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-12-07 10:21:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 8843 transitions. [2019-12-07 10:21:24,439 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 8843 transitions. Word has length 58 [2019-12-07 10:21:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:24,440 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 8843 transitions. [2019-12-07 10:21:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:21:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 8843 transitions. [2019-12-07 10:21:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 10:21:24,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:24,444 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] [2019-12-07 10:21:24,444 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash -850921972, now seen corresponding path program 2 times [2019-12-07 10:21:24,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:24,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042239472] [2019-12-07 10:21:24,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:24,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 10:21:24,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042239472] [2019-12-07 10:21:24,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:24,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:21:24,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204988443] [2019-12-07 10:21:24,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:21:24,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:24,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:21:24,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:21:24,574 INFO L87 Difference]: Start difference. First operand 4049 states and 8843 transitions. Second operand 9 states. [2019-12-07 10:21:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:25,077 INFO L93 Difference]: Finished difference Result 5376 states and 11290 transitions. [2019-12-07 10:21:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:21:25,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 10:21:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:25,081 INFO L225 Difference]: With dead ends: 5376 [2019-12-07 10:21:25,081 INFO L226 Difference]: Without dead ends: 5376 [2019-12-07 10:21:25,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:21:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5376 states. [2019-12-07 10:21:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5376 to 4532. [2019-12-07 10:21:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4532 states. [2019-12-07 10:21:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 9656 transitions. [2019-12-07 10:21:25,126 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 9656 transitions. Word has length 58 [2019-12-07 10:21:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:25,126 INFO L462 AbstractCegarLoop]: Abstraction has 4532 states and 9656 transitions. [2019-12-07 10:21:25,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:21:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 9656 transitions. [2019-12-07 10:21:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:21:25,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:25,131 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 10:21:25,131 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1929768525, now seen corresponding path program 1 times [2019-12-07 10:21:25,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:25,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035876100] [2019-12-07 10:21:25,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:25,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035876100] [2019-12-07 10:21:25,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:25,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:21:25,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206822620] [2019-12-07 10:21:25,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:21:25,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:21:25,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:25,189 INFO L87 Difference]: Start difference. First operand 4532 states and 9656 transitions. Second operand 3 states. [2019-12-07 10:21:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:25,207 INFO L93 Difference]: Finished difference Result 4532 states and 9655 transitions. [2019-12-07 10:21:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:21:25,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 10:21:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:25,212 INFO L225 Difference]: With dead ends: 4532 [2019-12-07 10:21:25,212 INFO L226 Difference]: Without dead ends: 4532 [2019-12-07 10:21:25,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:21:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2019-12-07 10:21:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4270. [2019-12-07 10:21:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2019-12-07 10:21:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 9162 transitions. [2019-12-07 10:21:25,265 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 9162 transitions. Word has length 59 [2019-12-07 10:21:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:25,265 INFO L462 AbstractCegarLoop]: Abstraction has 4270 states and 9162 transitions. [2019-12-07 10:21:25,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:21:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 9162 transitions. [2019-12-07 10:21:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:21:25,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:25,270 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 10:21:25,270 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 257297660, now seen corresponding path program 1 times [2019-12-07 10:21:25,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544003666] [2019-12-07 10:21:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:25,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544003666] [2019-12-07 10:21:25,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:25,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:21:25,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160690267] [2019-12-07 10:21:25,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:21:25,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:21:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:21:25,328 INFO L87 Difference]: Start difference. First operand 4270 states and 9162 transitions. Second operand 4 states. [2019-12-07 10:21:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:25,347 INFO L93 Difference]: Finished difference Result 4918 states and 10506 transitions. [2019-12-07 10:21:25,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:21:25,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 10:21:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:25,348 INFO L225 Difference]: With dead ends: 4918 [2019-12-07 10:21:25,348 INFO L226 Difference]: Without dead ends: 711 [2019-12-07 10:21:25,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:21:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-12-07 10:21:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2019-12-07 10:21:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-12-07 10:21:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1429 transitions. [2019-12-07 10:21:25,354 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1429 transitions. Word has length 59 [2019-12-07 10:21:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:25,354 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 1429 transitions. [2019-12-07 10:21:25,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:21:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1429 transitions. [2019-12-07 10:21:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:21:25,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:25,355 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 10:21:25,355 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash 506493247, now seen corresponding path program 1 times [2019-12-07 10:21:25,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:25,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807353683] [2019-12-07 10:21:25,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:21:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:21:25,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807353683] [2019-12-07 10:21:25,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:21:25,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:21:25,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031785841] [2019-12-07 10:21:25,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:21:25,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:21:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:21:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:21:25,436 INFO L87 Difference]: Start difference. First operand 711 states and 1429 transitions. Second operand 8 states. [2019-12-07 10:21:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:21:25,587 INFO L93 Difference]: Finished difference Result 1334 states and 2660 transitions. [2019-12-07 10:21:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:21:25,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-07 10:21:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:21:25,588 INFO L225 Difference]: With dead ends: 1334 [2019-12-07 10:21:25,588 INFO L226 Difference]: Without dead ends: 972 [2019-12-07 10:21:25,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:21:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-12-07 10:21:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 768. [2019-12-07 10:21:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-07 10:21:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1524 transitions. [2019-12-07 10:21:25,598 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1524 transitions. Word has length 60 [2019-12-07 10:21:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:21:25,598 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1524 transitions. [2019-12-07 10:21:25,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:21:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1524 transitions. [2019-12-07 10:21:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:21:25,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:21:25,600 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 10:21:25,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:21:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:21:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1329242083, now seen corresponding path program 2 times [2019-12-07 10:21:25,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:21:25,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220465892] [2019-12-07 10:21:25,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:21:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:21:25,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:21:25,696 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:21:25,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~weak$$choice2~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_165 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_471 0) (= v_~y$r_buff1_thd1~0_243 0) (= 0 v_~y$r_buff0_thd2~0_451) (= v_~y$r_buff1_thd0~0_188 0) (= v_~z~0_63 0) (= v_~main$tmp_guard1~0_35 0) (= v_~y$r_buff0_thd0~0_109 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t255~0.base_32|)) (= 0 v_~y$r_buff1_thd2~0_323) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t255~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t255~0.base_32|) |v_ULTIMATE.start_main_~#t255~0.offset_23| 0)) |v_#memory_int_17|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t255~0.base_32| 4)) (= 0 |v_#NULL.base_4|) (= v_~x~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t255~0.base_32|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_290 0) (= v_~y$w_buff1~0_183 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t255~0.base_32| 1)) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_43 0) (= 0 v_~y$w_buff0~0_198) (= 0 v_~__unbuffered_cnt~0_59) (= v_~y~0_230 0) (= v_~y$flush_delayed~0_205 0) (= 0 v_~weak$$choice0~0_154) (= v_~main$tmp_guard0~0_22 0) (= 0 |v_ULTIMATE.start_main_~#t255~0.offset_23|) (= v_~y$w_buff0_used~0_808 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_243, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_198, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_205, #length=|v_#length_17|, ~y~0=v_~y~0_230, ULTIMATE.start_main_~#t256~0.base=|v_ULTIMATE.start_main_~#t256~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_43, ULTIMATE.start_main_~#t256~0.offset=|v_ULTIMATE.start_main_~#t256~0.offset_14|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_100|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_64|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_323, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_164|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ULTIMATE.start_main_~#t255~0.base=|v_ULTIMATE.start_main_~#t255~0.base_32|, ULTIMATE.start_main_~#t255~0.offset=|v_ULTIMATE.start_main_~#t255~0.offset_23|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, #valid=|v_#valid_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_451, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_237, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~x~0=v_~x~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t256~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t256~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ULTIMATE.start_main_~#t255~0.base, ULTIMATE.start_main_~#t255~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:21:25,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-1-->L820: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t256~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t256~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t256~0.base_11|) |v_ULTIMATE.start_main_~#t256~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t256~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t256~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t256~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t256~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t256~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t256~0.offset=|v_ULTIMATE.start_main_~#t256~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t256~0.base=|v_ULTIMATE.start_main_~#t256~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t256~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t256~0.base] because there is no mapped edge [2019-12-07 10:21:25,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_50 v_~y$w_buff1~0_43) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~y$w_buff0_used~0_173 1) (= 1 v_~y$w_buff0~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_102 256))) (not (= 0 (mod v_~y$w_buff0_used~0_173 256))))) 1 0)) (= v_~y$w_buff0_used~0_174 v_~y$w_buff1_used~0_102)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_50, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_43, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_49, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:21:25,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L780-2-->L780-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1901735894| |P1Thread1of1ForFork1_#t~ite28_Out-1901735894|)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1901735894 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1901735894 256) 0))) (or (and (= ~y$w_buff1~0_In-1901735894 |P1Thread1of1ForFork1_#t~ite28_Out-1901735894|) .cse0 (or .cse1 .cse2)) (and (= ~y$w_buff0~0_In-1901735894 |P1Thread1of1ForFork1_#t~ite28_Out-1901735894|) .cse0 (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1901735894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1901735894, ~y$w_buff0~0=~y$w_buff0~0_In-1901735894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1901735894} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1901735894|, ~y$w_buff1~0=~y$w_buff1~0_In-1901735894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1901735894, ~y$w_buff0~0=~y$w_buff0~0_In-1901735894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1901735894, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1901735894|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:21:25,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_57 256) 0)) (= v_~y$r_buff0_thd2~0_101 v_~y$r_buff0_thd2~0_100)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_57} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 10:21:25,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1419621600 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out1419621600| ~y~0_In1419621600)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1419621600| ~y$mem_tmp~0_In1419621600) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1419621600, ~y$flush_delayed~0=~y$flush_delayed~0_In1419621600, ~y~0=~y~0_In1419621600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1419621600, ~y$flush_delayed~0=~y$flush_delayed~0_In1419621600, ~y~0=~y~0_In1419621600, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1419621600|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:21:25,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-294676547 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-294676547 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-294676547| 0)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-294676547| ~y$w_buff0_used~0_In-294676547) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294676547, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294676547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294676547, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-294676547|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294676547} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:21:25,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-390153663 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-390153663 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-390153663 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-390153663 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-390153663| ~y$w_buff1_used~0_In-390153663) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-390153663| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-390153663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390153663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-390153663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390153663} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-390153663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390153663, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-390153663|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-390153663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390153663} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:21:25,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1126232674 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1126232674 256))) (.cse2 (= ~y$r_buff0_thd2~0_Out-1126232674 ~y$r_buff0_thd2~0_In-1126232674))) (or (and (= ~y$r_buff0_thd2~0_Out-1126232674 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126232674, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126232674} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1126232674|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126232674, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1126232674} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:21:25,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In968451840 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In968451840 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In968451840 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In968451840 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out968451840|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In968451840 |P1Thread1of1ForFork1_#t~ite54_Out968451840|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In968451840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968451840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In968451840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In968451840} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In968451840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968451840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In968451840, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out968451840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In968451840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:21:25,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L799-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite54_26|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:21:25,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2136087279 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-2136087279| ~y$mem_tmp~0_In-2136087279) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out-2136087279| ~y~0_In-2136087279) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2136087279, ~y$flush_delayed~0=~y$flush_delayed~0_In-2136087279, ~y~0=~y~0_In-2136087279} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2136087279, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-2136087279|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2136087279, ~y~0=~y~0_In-2136087279} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:21:25,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L752-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y~0_147 |v_P0Thread1of1ForFork0_#t~ite25_28|) (= v_~y$flush_delayed~0_155 0) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_27|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~y~0=v_~y~0_147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:21:25,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:21:25,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1143835471 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1143835471 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-1143835471| |ULTIMATE.start_main_#t~ite57_Out-1143835471|))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-1143835471 |ULTIMATE.start_main_#t~ite57_Out-1143835471|) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1143835471| ~y~0_In-1143835471) (or .cse1 .cse2) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1143835471, ~y~0=~y~0_In-1143835471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1143835471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1143835471} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1143835471, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1143835471|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1143835471|, ~y~0=~y~0_In-1143835471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1143835471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1143835471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:21:25,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1655767721 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1655767721 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out1655767721|)) (and (= ~y$w_buff0_used~0_In1655767721 |ULTIMATE.start_main_#t~ite59_Out1655767721|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1655767721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655767721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1655767721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655767721, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1655767721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:21:25,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In158327369 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In158327369 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In158327369 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In158327369 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In158327369 |ULTIMATE.start_main_#t~ite60_Out158327369|)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out158327369|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In158327369, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In158327369, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In158327369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In158327369} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out158327369|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In158327369, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In158327369, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In158327369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In158327369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:21:25,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1538980264 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1538980264 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1538980264|)) (and (= ~y$r_buff0_thd0~0_In-1538980264 |ULTIMATE.start_main_#t~ite61_Out-1538980264|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1538980264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1538980264} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1538980264|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1538980264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1538980264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:21:25,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1358903035 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1358903035 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1358903035 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1358903035 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out1358903035| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1358903035| ~y$r_buff1_thd0~0_In1358903035) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1358903035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1358903035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1358903035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1358903035} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1358903035|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1358903035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1358903035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1358903035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1358903035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:21:25,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_178 |v_ULTIMATE.start_main_#t~ite62_44|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_25 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_33 0) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_39 0) (= 1 v_~__unbuffered_p0_EAX~0_52))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_43|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_178, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:21:25,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:21:25 BasicIcfg [2019-12-07 10:21:25,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:21:25,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:21:25,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:21:25,767 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:21:25,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:12" (3/4) ... [2019-12-07 10:21:25,768 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:21:25,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~weak$$choice2~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_165 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_471 0) (= v_~y$r_buff1_thd1~0_243 0) (= 0 v_~y$r_buff0_thd2~0_451) (= v_~y$r_buff1_thd0~0_188 0) (= v_~z~0_63 0) (= v_~main$tmp_guard1~0_35 0) (= v_~y$r_buff0_thd0~0_109 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t255~0.base_32|)) (= 0 v_~y$r_buff1_thd2~0_323) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t255~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t255~0.base_32|) |v_ULTIMATE.start_main_~#t255~0.offset_23| 0)) |v_#memory_int_17|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t255~0.base_32| 4)) (= 0 |v_#NULL.base_4|) (= v_~x~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t255~0.base_32|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_290 0) (= v_~y$w_buff1~0_183 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t255~0.base_32| 1)) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_43 0) (= 0 v_~y$w_buff0~0_198) (= 0 v_~__unbuffered_cnt~0_59) (= v_~y~0_230 0) (= v_~y$flush_delayed~0_205 0) (= 0 v_~weak$$choice0~0_154) (= v_~main$tmp_guard0~0_22 0) (= 0 |v_ULTIMATE.start_main_~#t255~0.offset_23|) (= v_~y$w_buff0_used~0_808 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_243, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_198, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_205, #length=|v_#length_17|, ~y~0=v_~y~0_230, ULTIMATE.start_main_~#t256~0.base=|v_ULTIMATE.start_main_~#t256~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_43, ULTIMATE.start_main_~#t256~0.offset=|v_ULTIMATE.start_main_~#t256~0.offset_14|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_100|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_64|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_323, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_164|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ULTIMATE.start_main_~#t255~0.base=|v_ULTIMATE.start_main_~#t255~0.base_32|, ULTIMATE.start_main_~#t255~0.offset=|v_ULTIMATE.start_main_~#t255~0.offset_23|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, #valid=|v_#valid_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_451, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_237, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~x~0=v_~x~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t256~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t256~0.offset, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ULTIMATE.start_main_~#t255~0.base, ULTIMATE.start_main_~#t255~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:21:25,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-1-->L820: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t256~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t256~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t256~0.base_11|) |v_ULTIMATE.start_main_~#t256~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t256~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t256~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t256~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t256~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t256~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t256~0.offset=|v_ULTIMATE.start_main_~#t256~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t256~0.base=|v_ULTIMATE.start_main_~#t256~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t256~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t256~0.base] because there is no mapped edge [2019-12-07 10:21:25,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_50 v_~y$w_buff1~0_43) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~y$w_buff0_used~0_173 1) (= 1 v_~y$w_buff0~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_102 256))) (not (= 0 (mod v_~y$w_buff0_used~0_173 256))))) 1 0)) (= v_~y$w_buff0_used~0_174 v_~y$w_buff1_used~0_102)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_50, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_43, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_49, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:21:25,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L780-2-->L780-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1901735894| |P1Thread1of1ForFork1_#t~ite28_Out-1901735894|)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1901735894 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1901735894 256) 0))) (or (and (= ~y$w_buff1~0_In-1901735894 |P1Thread1of1ForFork1_#t~ite28_Out-1901735894|) .cse0 (or .cse1 .cse2)) (and (= ~y$w_buff0~0_In-1901735894 |P1Thread1of1ForFork1_#t~ite28_Out-1901735894|) .cse0 (not .cse2) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1901735894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1901735894, ~y$w_buff0~0=~y$w_buff0~0_In-1901735894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1901735894} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1901735894|, ~y$w_buff1~0=~y$w_buff1~0_In-1901735894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1901735894, ~y$w_buff0~0=~y$w_buff0~0_In-1901735894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1901735894, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1901735894|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:21:25,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_57 256) 0)) (= v_~y$r_buff0_thd2~0_101 v_~y$r_buff0_thd2~0_100)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_57} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 10:21:25,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1419621600 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out1419621600| ~y~0_In1419621600)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1419621600| ~y$mem_tmp~0_In1419621600) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1419621600, ~y$flush_delayed~0=~y$flush_delayed~0_In1419621600, ~y~0=~y~0_In1419621600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1419621600, ~y$flush_delayed~0=~y$flush_delayed~0_In1419621600, ~y~0=~y~0_In1419621600, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1419621600|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:21:25,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-294676547 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-294676547 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-294676547| 0)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out-294676547| ~y$w_buff0_used~0_In-294676547) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-294676547, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294676547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-294676547, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-294676547|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294676547} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:21:25,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-390153663 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-390153663 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-390153663 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-390153663 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-390153663| ~y$w_buff1_used~0_In-390153663) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-390153663| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-390153663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390153663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-390153663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390153663} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-390153663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-390153663, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-390153663|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-390153663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-390153663} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:21:25,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1126232674 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1126232674 256))) (.cse2 (= ~y$r_buff0_thd2~0_Out-1126232674 ~y$r_buff0_thd2~0_In-1126232674))) (or (and (= ~y$r_buff0_thd2~0_Out-1126232674 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126232674, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1126232674} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1126232674|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1126232674, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1126232674} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:21:25,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In968451840 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In968451840 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In968451840 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In968451840 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out968451840|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In968451840 |P1Thread1of1ForFork1_#t~ite54_Out968451840|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In968451840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968451840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In968451840, ~y$w_buff1_used~0=~y$w_buff1_used~0_In968451840} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In968451840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968451840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In968451840, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out968451840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In968451840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:21:25,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L799-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite54_26|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:21:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2136087279 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-2136087279| ~y$mem_tmp~0_In-2136087279) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out-2136087279| ~y~0_In-2136087279) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2136087279, ~y$flush_delayed~0=~y$flush_delayed~0_In-2136087279, ~y~0=~y~0_In-2136087279} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2136087279, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-2136087279|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2136087279, ~y~0=~y~0_In-2136087279} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:21:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L752-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y~0_147 |v_P0Thread1of1ForFork0_#t~ite25_28|) (= v_~y$flush_delayed~0_155 0) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_27|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~y~0=v_~y~0_147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:21:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:21:25,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1143835471 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1143835471 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-1143835471| |ULTIMATE.start_main_#t~ite57_Out-1143835471|))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-1143835471 |ULTIMATE.start_main_#t~ite57_Out-1143835471|) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1143835471| ~y~0_In-1143835471) (or .cse1 .cse2) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1143835471, ~y~0=~y~0_In-1143835471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1143835471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1143835471} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1143835471, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1143835471|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1143835471|, ~y~0=~y~0_In-1143835471, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1143835471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1143835471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:21:25,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1655767721 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1655767721 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out1655767721|)) (and (= ~y$w_buff0_used~0_In1655767721 |ULTIMATE.start_main_#t~ite59_Out1655767721|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1655767721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655767721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1655767721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655767721, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1655767721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:21:25,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In158327369 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In158327369 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In158327369 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In158327369 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In158327369 |ULTIMATE.start_main_#t~ite60_Out158327369|)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out158327369|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In158327369, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In158327369, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In158327369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In158327369} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out158327369|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In158327369, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In158327369, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In158327369, ~y$w_buff1_used~0=~y$w_buff1_used~0_In158327369} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:21:25,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1538980264 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1538980264 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-1538980264|)) (and (= ~y$r_buff0_thd0~0_In-1538980264 |ULTIMATE.start_main_#t~ite61_Out-1538980264|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1538980264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1538980264} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1538980264|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1538980264, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1538980264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:21:25,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1358903035 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1358903035 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1358903035 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1358903035 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out1358903035| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1358903035| ~y$r_buff1_thd0~0_In1358903035) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1358903035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1358903035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1358903035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1358903035} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1358903035|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1358903035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1358903035, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1358903035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1358903035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:21:25,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_178 |v_ULTIMATE.start_main_#t~ite62_44|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_25 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_33 0) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_39 0) (= 1 v_~__unbuffered_p0_EAX~0_52))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_43|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_178, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:21:25,840 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_16ed3415-f91a-42b1-a304-59d57646d6cf/bin/uautomizer/witness.graphml [2019-12-07 10:21:25,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:21:25,841 INFO L168 Benchmark]: Toolchain (without parser) took 13968.21 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 931.7 MB). Free memory was 939.8 MB in the beginning and 1.5 GB in the end (delta: -577.4 MB). Peak memory consumption was 354.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,841 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:21:25,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,842 INFO L168 Benchmark]: Boogie Preprocessor took 26.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,842 INFO L168 Benchmark]: RCFGBuilder took 422.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,842 INFO L168 Benchmark]: TraceAbstraction took 13006.51 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 827.3 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -553.0 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,843 INFO L168 Benchmark]: Witness Printer took 73.42 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:21:25,844 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 422.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13006.51 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 827.3 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -553.0 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. * Witness Printer took 73.42 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 180 ProgramPointsBefore, 101 ProgramPointsAfterwards, 229 TransitionsBefore, 123 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 30 ChoiceCompositions, 9541 VarBasedMoverChecksPositive, 277 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 118733 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t255, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t256, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y 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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L781] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) 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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 __unbuffered_p1_EAX = 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=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z 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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EBX = y 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2703 SDtfs, 2216 SDslu, 4263 SDs, 0 SdLazy, 2140 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53845occurred 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 17585 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 84291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...