./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/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 8888c15f38555eb2104e5241b044ef86c42f91d9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 08:56:04,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:04,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:04,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:04,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:04,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:04,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:04,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:04,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:04,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:04,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:04,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:04,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:04,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:04,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:04,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:04,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:04,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:04,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:04,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:04,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:04,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:04,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:04,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:04,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:04,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:04,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:04,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:04,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:04,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:04,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:04,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:04,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:04,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:04,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:04,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:04,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:04,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:04,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:04,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:04,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:04,345 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:56:04,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:04,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:04,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:04,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:04,366 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:04,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:04,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:04,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:04,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:04,367 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:04,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:56:04,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:04,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:04,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:56:04,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:56:04,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:04,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:04,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:56:04,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:56:04,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:04,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:56:04,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:56:04,369 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/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/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 -> 8888c15f38555eb2104e5241b044ef86c42f91d9 [2019-10-22 08:56:04,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:04,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:04,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:04,418 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:04,422 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:04,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-10-22 08:56:04,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/data/e0a7600bd/f56f4640d6e24ad0963264be191c1287/FLAGc7a83f766 [2019-10-22 08:56:04,909 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:04,909 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-10-22 08:56:04,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/data/e0a7600bd/f56f4640d6e24ad0963264be191c1287/FLAGc7a83f766 [2019-10-22 08:56:05,243 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/data/e0a7600bd/f56f4640d6e24ad0963264be191c1287 [2019-10-22 08:56:05,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:05,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:05,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:05,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:05,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:05,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dedff11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05, skipping insertion in model container [2019-10-22 08:56:05,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,259 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:05,294 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:05,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:05,685 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:05,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:05,813 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:05,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05 WrapperNode [2019-10-22 08:56:05,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:05,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:05,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:05,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:05,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:05,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:05,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:05,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:05,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... [2019-10-22 08:56:05,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:05,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:05,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:05,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:05,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/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-10-22 08:56:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 08:56:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:05,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 08:56:05,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 08:56:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 08:56:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 08:56:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 08:56:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:05,962 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 08:56:06,465 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:06,465 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:56:06,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:06 BoogieIcfgContainer [2019-10-22 08:56:06,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:06,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:56:06,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:56:06,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:56:06,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:56:05" (1/3) ... [2019-10-22 08:56:06,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f56bc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:06, skipping insertion in model container [2019-10-22 08:56:06,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:05" (2/3) ... [2019-10-22 08:56:06,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f56bc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:06, skipping insertion in model container [2019-10-22 08:56:06,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:06" (3/3) ... [2019-10-22 08:56:06,474 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt.i [2019-10-22 08:56:06,512 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,518 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,519 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,520 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,521 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,522 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,523 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,524 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,525 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,526 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,528 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,529 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,530 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,531 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,533 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,536 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,537 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:56:06,557 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 08:56:06,557 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:56:06,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:56:06,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:56:06,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:56:06,597 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:56:06,597 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:56:06,597 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:06,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:06,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:56:06,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:06,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:56:06,609 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 166 transitions [2019-10-22 08:56:08,851 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2019-10-22 08:56:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2019-10-22 08:56:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:56:08,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:08,866 INFO L380 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] [2019-10-22 08:56:08,868 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash -379972106, now seen corresponding path program 1 times [2019-10-22 08:56:08,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444780552] [2019-10-22 08:56:08,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:09,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444780552] [2019-10-22 08:56:09,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:09,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:09,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44122973] [2019-10-22 08:56:09,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:09,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:09,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:09,237 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2019-10-22 08:56:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:09,880 INFO L93 Difference]: Finished difference Result 28526 states and 108883 transitions. [2019-10-22 08:56:09,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:09,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-22 08:56:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:10,071 INFO L225 Difference]: With dead ends: 28526 [2019-10-22 08:56:10,072 INFO L226 Difference]: Without dead ends: 21758 [2019-10-22 08:56:10,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21758 states. [2019-10-22 08:56:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21758 to 21758. [2019-10-22 08:56:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2019-10-22 08:56:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2019-10-22 08:56:11,311 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2019-10-22 08:56:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:11,311 INFO L462 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2019-10-22 08:56:11,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2019-10-22 08:56:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:56:11,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:11,318 INFO L380 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] [2019-10-22 08:56:11,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash -750842194, now seen corresponding path program 1 times [2019-10-22 08:56:11,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:11,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494681837] [2019-10-22 08:56:11,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:11,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494681837] [2019-10-22 08:56:11,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:11,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:11,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20460161] [2019-10-22 08:56:11,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:11,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:11,405 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 5 states. [2019-10-22 08:56:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:12,321 INFO L93 Difference]: Finished difference Result 34172 states and 124043 transitions. [2019-10-22 08:56:12,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:12,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-22 08:56:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:12,809 INFO L225 Difference]: With dead ends: 34172 [2019-10-22 08:56:12,809 INFO L226 Difference]: Without dead ends: 33604 [2019-10-22 08:56:12,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33604 states. [2019-10-22 08:56:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33604 to 31798. [2019-10-22 08:56:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31798 states. [2019-10-22 08:56:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31798 states to 31798 states and 116821 transitions. [2019-10-22 08:56:13,876 INFO L78 Accepts]: Start accepts. Automaton has 31798 states and 116821 transitions. Word has length 49 [2019-10-22 08:56:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:13,877 INFO L462 AbstractCegarLoop]: Abstraction has 31798 states and 116821 transitions. [2019-10-22 08:56:13,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 31798 states and 116821 transitions. [2019-10-22 08:56:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:56:13,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:13,889 INFO L380 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] [2019-10-22 08:56:13,889 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1856913635, now seen corresponding path program 1 times [2019-10-22 08:56:13,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173362501] [2019-10-22 08:56:13,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:13,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173362501] [2019-10-22 08:56:13,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:13,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:13,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679135288] [2019-10-22 08:56:13,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:13,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:13,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:13,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:13,972 INFO L87 Difference]: Start difference. First operand 31798 states and 116821 transitions. Second operand 5 states. [2019-10-22 08:56:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:14,751 INFO L93 Difference]: Finished difference Result 41646 states and 149745 transitions. [2019-10-22 08:56:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:14,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-22 08:56:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:14,904 INFO L225 Difference]: With dead ends: 41646 [2019-10-22 08:56:14,904 INFO L226 Difference]: Without dead ends: 41182 [2019-10-22 08:56:14,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41182 states. [2019-10-22 08:56:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41182 to 35366. [2019-10-22 08:56:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35366 states. [2019-10-22 08:56:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35366 states to 35366 states and 128879 transitions. [2019-10-22 08:56:15,880 INFO L78 Accepts]: Start accepts. Automaton has 35366 states and 128879 transitions. Word has length 50 [2019-10-22 08:56:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:15,880 INFO L462 AbstractCegarLoop]: Abstraction has 35366 states and 128879 transitions. [2019-10-22 08:56:15,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35366 states and 128879 transitions. [2019-10-22 08:56:15,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 08:56:15,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:15,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:15,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:15,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1329818935, now seen corresponding path program 1 times [2019-10-22 08:56:15,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:15,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765274561] [2019-10-22 08:56:15,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:15,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:15,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765274561] [2019-10-22 08:56:15,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:15,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:15,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910715601] [2019-10-22 08:56:15,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:15,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:15,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:15,934 INFO L87 Difference]: Start difference. First operand 35366 states and 128879 transitions. Second operand 3 states. [2019-10-22 08:56:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:16,204 INFO L93 Difference]: Finished difference Result 45912 states and 163947 transitions. [2019-10-22 08:56:16,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:16,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-22 08:56:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:16,766 INFO L225 Difference]: With dead ends: 45912 [2019-10-22 08:56:16,767 INFO L226 Difference]: Without dead ends: 45912 [2019-10-22 08:56:16,767 INFO L600 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-10-22 08:56:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45912 states. [2019-10-22 08:56:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45912 to 40249. [2019-10-22 08:56:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40249 states. [2019-10-22 08:56:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40249 states to 40249 states and 145217 transitions. [2019-10-22 08:56:17,712 INFO L78 Accepts]: Start accepts. Automaton has 40249 states and 145217 transitions. Word has length 52 [2019-10-22 08:56:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:17,713 INFO L462 AbstractCegarLoop]: Abstraction has 40249 states and 145217 transitions. [2019-10-22 08:56:17,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 40249 states and 145217 transitions. [2019-10-22 08:56:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:56:17,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:17,730 INFO L380 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] [2019-10-22 08:56:17,730 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash 865276026, now seen corresponding path program 1 times [2019-10-22 08:56:17,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:17,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220188856] [2019-10-22 08:56:17,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:17,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:17,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:17,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220188856] [2019-10-22 08:56:17,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:17,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:17,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857108893] [2019-10-22 08:56:17,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:17,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:17,841 INFO L87 Difference]: Start difference. First operand 40249 states and 145217 transitions. Second operand 6 states. [2019-10-22 08:56:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:18,653 INFO L93 Difference]: Finished difference Result 55268 states and 197194 transitions. [2019-10-22 08:56:19,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:19,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-22 08:56:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:19,286 INFO L225 Difference]: With dead ends: 55268 [2019-10-22 08:56:19,286 INFO L226 Difference]: Without dead ends: 54327 [2019-10-22 08:56:19,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54327 states. [2019-10-22 08:56:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54327 to 51013. [2019-10-22 08:56:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51013 states. [2019-10-22 08:56:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51013 states to 51013 states and 182732 transitions. [2019-10-22 08:56:20,322 INFO L78 Accepts]: Start accepts. Automaton has 51013 states and 182732 transitions. Word has length 56 [2019-10-22 08:56:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:20,323 INFO L462 AbstractCegarLoop]: Abstraction has 51013 states and 182732 transitions. [2019-10-22 08:56:20,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 51013 states and 182732 transitions. [2019-10-22 08:56:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:56:20,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:20,340 INFO L380 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] [2019-10-22 08:56:20,340 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash -931675333, now seen corresponding path program 1 times [2019-10-22 08:56:20,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:20,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121775812] [2019-10-22 08:56:20,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:20,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:20,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:20,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121775812] [2019-10-22 08:56:20,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:20,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:20,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120136986] [2019-10-22 08:56:20,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:20,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:20,427 INFO L87 Difference]: Start difference. First operand 51013 states and 182732 transitions. Second operand 3 states. [2019-10-22 08:56:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:20,639 INFO L93 Difference]: Finished difference Result 45822 states and 159055 transitions. [2019-10-22 08:56:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:20,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-22 08:56:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:20,737 INFO L225 Difference]: With dead ends: 45822 [2019-10-22 08:56:20,737 INFO L226 Difference]: Without dead ends: 45242 [2019-10-22 08:56:20,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-22 08:56:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45242 states. [2019-10-22 08:56:21,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45242 to 43509. [2019-10-22 08:56:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43509 states. [2019-10-22 08:56:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43509 states to 43509 states and 151906 transitions. [2019-10-22 08:56:21,589 INFO L78 Accepts]: Start accepts. Automaton has 43509 states and 151906 transitions. Word has length 56 [2019-10-22 08:56:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:21,589 INFO L462 AbstractCegarLoop]: Abstraction has 43509 states and 151906 transitions. [2019-10-22 08:56:21,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 43509 states and 151906 transitions. [2019-10-22 08:56:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 08:56:21,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:21,604 INFO L380 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] [2019-10-22 08:56:21,604 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1629805932, now seen corresponding path program 1 times [2019-10-22 08:56:21,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294669500] [2019-10-22 08:56:21,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:21,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294669500] [2019-10-22 08:56:21,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:21,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:21,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362687484] [2019-10-22 08:56:21,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:21,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:21,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:21,723 INFO L87 Difference]: Start difference. First operand 43509 states and 151906 transitions. Second operand 6 states. [2019-10-22 08:56:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:22,684 INFO L93 Difference]: Finished difference Result 56527 states and 194079 transitions. [2019-10-22 08:56:22,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:56:22,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-22 08:56:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:22,799 INFO L225 Difference]: With dead ends: 56527 [2019-10-22 08:56:22,799 INFO L226 Difference]: Without dead ends: 55991 [2019-10-22 08:56:22,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:56:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55991 states. [2019-10-22 08:56:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55991 to 44424. [2019-10-22 08:56:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44424 states. [2019-10-22 08:56:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44424 states to 44424 states and 155157 transitions. [2019-10-22 08:56:23,683 INFO L78 Accepts]: Start accepts. Automaton has 44424 states and 155157 transitions. Word has length 56 [2019-10-22 08:56:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:23,684 INFO L462 AbstractCegarLoop]: Abstraction has 44424 states and 155157 transitions. [2019-10-22 08:56:23,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 44424 states and 155157 transitions. [2019-10-22 08:56:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-22 08:56:23,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:23,693 INFO L380 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] [2019-10-22 08:56:23,693 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 622644749, now seen corresponding path program 1 times [2019-10-22 08:56:23,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:23,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788721095] [2019-10-22 08:56:23,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:23,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788721095] [2019-10-22 08:56:23,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:23,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:23,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235983599] [2019-10-22 08:56:23,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:23,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:23,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:23,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:23,759 INFO L87 Difference]: Start difference. First operand 44424 states and 155157 transitions. Second operand 4 states. [2019-10-22 08:56:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:23,819 INFO L93 Difference]: Finished difference Result 10154 states and 31524 transitions. [2019-10-22 08:56:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:23,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-22 08:56:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:23,832 INFO L225 Difference]: With dead ends: 10154 [2019-10-22 08:56:23,832 INFO L226 Difference]: Without dead ends: 8648 [2019-10-22 08:56:23,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-22 08:56:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8648 states. [2019-10-22 08:56:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8648 to 8600. [2019-10-22 08:56:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8600 states. [2019-10-22 08:56:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8600 states to 8600 states and 26469 transitions. [2019-10-22 08:56:23,944 INFO L78 Accepts]: Start accepts. Automaton has 8600 states and 26469 transitions. Word has length 57 [2019-10-22 08:56:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:23,944 INFO L462 AbstractCegarLoop]: Abstraction has 8600 states and 26469 transitions. [2019-10-22 08:56:23,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8600 states and 26469 transitions. [2019-10-22 08:56:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:56:23,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:23,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:23,947 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1823345351, now seen corresponding path program 1 times [2019-10-22 08:56:23,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:23,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114707296] [2019-10-22 08:56:23,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:24,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114707296] [2019-10-22 08:56:24,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:24,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:24,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365771607] [2019-10-22 08:56:24,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:24,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:24,005 INFO L87 Difference]: Start difference. First operand 8600 states and 26469 transitions. Second operand 4 states. [2019-10-22 08:56:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:24,118 INFO L93 Difference]: Finished difference Result 10219 states and 31176 transitions. [2019-10-22 08:56:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:24,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-22 08:56:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:24,130 INFO L225 Difference]: With dead ends: 10219 [2019-10-22 08:56:24,130 INFO L226 Difference]: Without dead ends: 10219 [2019-10-22 08:56:24,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-22 08:56:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-10-22 08:56:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 9251. [2019-10-22 08:56:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9251 states. [2019-10-22 08:56:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9251 states to 9251 states and 28330 transitions. [2019-10-22 08:56:24,262 INFO L78 Accepts]: Start accepts. Automaton has 9251 states and 28330 transitions. Word has length 66 [2019-10-22 08:56:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:24,262 INFO L462 AbstractCegarLoop]: Abstraction has 9251 states and 28330 transitions. [2019-10-22 08:56:24,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9251 states and 28330 transitions. [2019-10-22 08:56:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 08:56:24,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:24,267 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:24,267 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:24,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash -728811610, now seen corresponding path program 1 times [2019-10-22 08:56:24,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:24,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669736365] [2019-10-22 08:56:24,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:24,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:24,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:24,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669736365] [2019-10-22 08:56:24,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:24,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:24,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599043572] [2019-10-22 08:56:24,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:24,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:24,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:24,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:24,334 INFO L87 Difference]: Start difference. First operand 9251 states and 28330 transitions. Second operand 6 states. [2019-10-22 08:56:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:24,630 INFO L93 Difference]: Finished difference Result 12024 states and 36329 transitions. [2019-10-22 08:56:24,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:56:24,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-22 08:56:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:24,645 INFO L225 Difference]: With dead ends: 12024 [2019-10-22 08:56:24,645 INFO L226 Difference]: Without dead ends: 11960 [2019-10-22 08:56:24,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11960 states. [2019-10-22 08:56:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11960 to 10332. [2019-10-22 08:56:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10332 states. [2019-10-22 08:56:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10332 states to 10332 states and 31499 transitions. [2019-10-22 08:56:24,781 INFO L78 Accepts]: Start accepts. Automaton has 10332 states and 31499 transitions. Word has length 66 [2019-10-22 08:56:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:24,782 INFO L462 AbstractCegarLoop]: Abstraction has 10332 states and 31499 transitions. [2019-10-22 08:56:24,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 10332 states and 31499 transitions. [2019-10-22 08:56:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:56:24,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:24,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:24,787 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash -550791368, now seen corresponding path program 1 times [2019-10-22 08:56:24,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:24,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914239926] [2019-10-22 08:56:24,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:24,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:24,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:24,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914239926] [2019-10-22 08:56:24,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:24,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:24,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340907126] [2019-10-22 08:56:24,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:24,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:24,862 INFO L87 Difference]: Start difference. First operand 10332 states and 31499 transitions. Second operand 4 states. [2019-10-22 08:56:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:25,089 INFO L93 Difference]: Finished difference Result 13760 states and 41439 transitions. [2019-10-22 08:56:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:25,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-22 08:56:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:25,114 INFO L225 Difference]: With dead ends: 13760 [2019-10-22 08:56:25,115 INFO L226 Difference]: Without dead ends: 13760 [2019-10-22 08:56:25,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13760 states. [2019-10-22 08:56:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13760 to 11599. [2019-10-22 08:56:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11599 states. [2019-10-22 08:56:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11599 states to 11599 states and 35106 transitions. [2019-10-22 08:56:25,407 INFO L78 Accepts]: Start accepts. Automaton has 11599 states and 35106 transitions. Word has length 70 [2019-10-22 08:56:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:25,407 INFO L462 AbstractCegarLoop]: Abstraction has 11599 states and 35106 transitions. [2019-10-22 08:56:25,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11599 states and 35106 transitions. [2019-10-22 08:56:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:56:25,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:25,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:25,419 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash 693973113, now seen corresponding path program 1 times [2019-10-22 08:56:25,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:25,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114846252] [2019-10-22 08:56:25,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:25,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:25,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:25,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114846252] [2019-10-22 08:56:25,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:25,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:25,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415570262] [2019-10-22 08:56:25,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:25,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:25,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:25,519 INFO L87 Difference]: Start difference. First operand 11599 states and 35106 transitions. Second operand 6 states. [2019-10-22 08:56:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:25,991 INFO L93 Difference]: Finished difference Result 13092 states and 38917 transitions. [2019-10-22 08:56:25,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:25,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-22 08:56:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:26,013 INFO L225 Difference]: With dead ends: 13092 [2019-10-22 08:56:26,013 INFO L226 Difference]: Without dead ends: 13092 [2019-10-22 08:56:26,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13092 states. [2019-10-22 08:56:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13092 to 12736. [2019-10-22 08:56:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12736 states. [2019-10-22 08:56:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12736 states to 12736 states and 37976 transitions. [2019-10-22 08:56:26,203 INFO L78 Accepts]: Start accepts. Automaton has 12736 states and 37976 transitions. Word has length 70 [2019-10-22 08:56:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:26,203 INFO L462 AbstractCegarLoop]: Abstraction has 12736 states and 37976 transitions. [2019-10-22 08:56:26,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 12736 states and 37976 transitions. [2019-10-22 08:56:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:56:26,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:26,212 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:26,213 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1383236230, now seen corresponding path program 1 times [2019-10-22 08:56:26,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:26,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396358723] [2019-10-22 08:56:26,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:26,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:26,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:26,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396358723] [2019-10-22 08:56:26,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:26,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:26,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225506105] [2019-10-22 08:56:26,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:26,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:26,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:26,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:26,324 INFO L87 Difference]: Start difference. First operand 12736 states and 37976 transitions. Second operand 6 states. [2019-10-22 08:56:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:26,681 INFO L93 Difference]: Finished difference Result 15085 states and 43759 transitions. [2019-10-22 08:56:26,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:56:26,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-22 08:56:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:26,708 INFO L225 Difference]: With dead ends: 15085 [2019-10-22 08:56:26,708 INFO L226 Difference]: Without dead ends: 15085 [2019-10-22 08:56:26,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15085 states. [2019-10-22 08:56:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15085 to 12975. [2019-10-22 08:56:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12975 states. [2019-10-22 08:56:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 38020 transitions. [2019-10-22 08:56:26,887 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 38020 transitions. Word has length 70 [2019-10-22 08:56:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:26,887 INFO L462 AbstractCegarLoop]: Abstraction has 12975 states and 38020 transitions. [2019-10-22 08:56:26,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 38020 transitions. [2019-10-22 08:56:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:56:26,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:26,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:26,896 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1171885317, now seen corresponding path program 1 times [2019-10-22 08:56:26,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:26,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275930352] [2019-10-22 08:56:26,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:26,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:26,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:26,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275930352] [2019-10-22 08:56:26,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:26,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:26,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014194173] [2019-10-22 08:56:26,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:26,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:26,964 INFO L87 Difference]: Start difference. First operand 12975 states and 38020 transitions. Second operand 5 states. [2019-10-22 08:56:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:27,185 INFO L93 Difference]: Finished difference Result 15980 states and 46604 transitions. [2019-10-22 08:56:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:27,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-22 08:56:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:27,207 INFO L225 Difference]: With dead ends: 15980 [2019-10-22 08:56:27,207 INFO L226 Difference]: Without dead ends: 15980 [2019-10-22 08:56:27,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-10-22 08:56:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15980 states. [2019-10-22 08:56:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15980 to 13918. [2019-10-22 08:56:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13918 states. [2019-10-22 08:56:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13918 states to 13918 states and 40450 transitions. [2019-10-22 08:56:27,406 INFO L78 Accepts]: Start accepts. Automaton has 13918 states and 40450 transitions. Word has length 70 [2019-10-22 08:56:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:27,406 INFO L462 AbstractCegarLoop]: Abstraction has 13918 states and 40450 transitions. [2019-10-22 08:56:27,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 13918 states and 40450 transitions. [2019-10-22 08:56:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:56:27,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:27,417 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:27,417 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1682419494, now seen corresponding path program 1 times [2019-10-22 08:56:27,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:27,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733707111] [2019-10-22 08:56:27,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:27,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:27,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733707111] [2019-10-22 08:56:27,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:27,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:27,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194434656] [2019-10-22 08:56:27,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:27,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:27,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:27,482 INFO L87 Difference]: Start difference. First operand 13918 states and 40450 transitions. Second operand 4 states. [2019-10-22 08:56:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:27,910 INFO L93 Difference]: Finished difference Result 17366 states and 50544 transitions. [2019-10-22 08:56:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:27,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-22 08:56:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:27,932 INFO L225 Difference]: With dead ends: 17366 [2019-10-22 08:56:27,932 INFO L226 Difference]: Without dead ends: 16854 [2019-10-22 08:56:27,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-22 08:56:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16854 states. [2019-10-22 08:56:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16854 to 16122. [2019-10-22 08:56:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16122 states. [2019-10-22 08:56:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16122 states to 16122 states and 46799 transitions. [2019-10-22 08:56:28,141 INFO L78 Accepts]: Start accepts. Automaton has 16122 states and 46799 transitions. Word has length 70 [2019-10-22 08:56:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:28,141 INFO L462 AbstractCegarLoop]: Abstraction has 16122 states and 46799 transitions. [2019-10-22 08:56:28,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 16122 states and 46799 transitions. [2019-10-22 08:56:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-22 08:56:28,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:28,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:28,150 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash 815596443, now seen corresponding path program 1 times [2019-10-22 08:56:28,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:28,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561707716] [2019-10-22 08:56:28,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:28,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561707716] [2019-10-22 08:56:28,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:28,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:28,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149345367] [2019-10-22 08:56:28,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:28,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:28,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:28,217 INFO L87 Difference]: Start difference. First operand 16122 states and 46799 transitions. Second operand 5 states. [2019-10-22 08:56:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:28,264 INFO L93 Difference]: Finished difference Result 5110 states and 12216 transitions. [2019-10-22 08:56:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:28,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-22 08:56:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:28,268 INFO L225 Difference]: With dead ends: 5110 [2019-10-22 08:56:28,268 INFO L226 Difference]: Without dead ends: 4117 [2019-10-22 08:56:28,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2019-10-22 08:56:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3576. [2019-10-22 08:56:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3576 states. [2019-10-22 08:56:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 8324 transitions. [2019-10-22 08:56:28,302 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 8324 transitions. Word has length 70 [2019-10-22 08:56:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:28,302 INFO L462 AbstractCegarLoop]: Abstraction has 3576 states and 8324 transitions. [2019-10-22 08:56:28,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 8324 transitions. [2019-10-22 08:56:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:56:28,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:28,305 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:28,305 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash 518978213, now seen corresponding path program 1 times [2019-10-22 08:56:28,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:28,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008755396] [2019-10-22 08:56:28,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:28,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008755396] [2019-10-22 08:56:28,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:28,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:28,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399952378] [2019-10-22 08:56:28,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:56:28,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:28,369 INFO L87 Difference]: Start difference. First operand 3576 states and 8324 transitions. Second operand 5 states. [2019-10-22 08:56:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:28,545 INFO L93 Difference]: Finished difference Result 4598 states and 10541 transitions. [2019-10-22 08:56:28,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:28,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-22 08:56:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:28,551 INFO L225 Difference]: With dead ends: 4598 [2019-10-22 08:56:28,551 INFO L226 Difference]: Without dead ends: 4564 [2019-10-22 08:56:28,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-10-22 08:56:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 3665. [2019-10-22 08:56:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2019-10-22 08:56:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 8502 transitions. [2019-10-22 08:56:28,591 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 8502 transitions. Word has length 87 [2019-10-22 08:56:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:28,591 INFO L462 AbstractCegarLoop]: Abstraction has 3665 states and 8502 transitions. [2019-10-22 08:56:28,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:56:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 8502 transitions. [2019-10-22 08:56:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:56:28,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:28,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:28,595 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1562879847, now seen corresponding path program 1 times [2019-10-22 08:56:28,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:28,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441087907] [2019-10-22 08:56:28,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:28,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441087907] [2019-10-22 08:56:28,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:28,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:28,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245609374] [2019-10-22 08:56:28,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:28,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:28,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:28,656 INFO L87 Difference]: Start difference. First operand 3665 states and 8502 transitions. Second operand 4 states. [2019-10-22 08:56:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:28,691 INFO L93 Difference]: Finished difference Result 3585 states and 8270 transitions. [2019-10-22 08:56:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:28,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-22 08:56:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:28,694 INFO L225 Difference]: With dead ends: 3585 [2019-10-22 08:56:28,694 INFO L226 Difference]: Without dead ends: 3585 [2019-10-22 08:56:28,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-22 08:56:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2019-10-22 08:56:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3139. [2019-10-22 08:56:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2019-10-22 08:56:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 7238 transitions. [2019-10-22 08:56:28,725 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 7238 transitions. Word has length 87 [2019-10-22 08:56:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:28,726 INFO L462 AbstractCegarLoop]: Abstraction has 3139 states and 7238 transitions. [2019-10-22 08:56:28,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 7238 transitions. [2019-10-22 08:56:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:56:28,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:28,729 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:28,729 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -744605689, now seen corresponding path program 1 times [2019-10-22 08:56:28,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:28,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680025994] [2019-10-22 08:56:28,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:28,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:28,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680025994] [2019-10-22 08:56:28,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:28,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:28,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518545811] [2019-10-22 08:56:28,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:28,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:28,818 INFO L87 Difference]: Start difference. First operand 3139 states and 7238 transitions. Second operand 6 states. [2019-10-22 08:56:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:29,053 INFO L93 Difference]: Finished difference Result 3539 states and 8118 transitions. [2019-10-22 08:56:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:29,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-22 08:56:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:29,056 INFO L225 Difference]: With dead ends: 3539 [2019-10-22 08:56:29,056 INFO L226 Difference]: Without dead ends: 3539 [2019-10-22 08:56:29,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2019-10-22 08:56:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3077. [2019-10-22 08:56:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3077 states. [2019-10-22 08:56:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 7108 transitions. [2019-10-22 08:56:29,100 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 7108 transitions. Word has length 87 [2019-10-22 08:56:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:29,101 INFO L462 AbstractCegarLoop]: Abstraction has 3077 states and 7108 transitions. [2019-10-22 08:56:29,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 7108 transitions. [2019-10-22 08:56:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:56:29,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,105 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1378015638, now seen corresponding path program 1 times [2019-10-22 08:56:29,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375924873] [2019-10-22 08:56:29,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:29,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375924873] [2019-10-22 08:56:29,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:29,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:56:29,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517482099] [2019-10-22 08:56:29,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:56:29,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:29,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:29,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:29,263 INFO L87 Difference]: Start difference. First operand 3077 states and 7108 transitions. Second operand 10 states. [2019-10-22 08:56:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:29,554 INFO L93 Difference]: Finished difference Result 8147 states and 19078 transitions. [2019-10-22 08:56:29,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 08:56:29,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-10-22 08:56:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:29,559 INFO L225 Difference]: With dead ends: 8147 [2019-10-22 08:56:29,559 INFO L226 Difference]: Without dead ends: 5446 [2019-10-22 08:56:29,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:56:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2019-10-22 08:56:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 3235. [2019-10-22 08:56:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3235 states. [2019-10-22 08:56:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 7430 transitions. [2019-10-22 08:56:29,608 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 7430 transitions. Word has length 87 [2019-10-22 08:56:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:29,609 INFO L462 AbstractCegarLoop]: Abstraction has 3235 states and 7430 transitions. [2019-10-22 08:56:29,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:56:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 7430 transitions. [2019-10-22 08:56:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:56:29,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,613 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,613 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,613 INFO L82 PathProgramCache]: Analyzing trace with hash 226400213, now seen corresponding path program 2 times [2019-10-22 08:56:29,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622517748] [2019-10-22 08:56:29,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:29,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622517748] [2019-10-22 08:56:29,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:29,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:29,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068253803] [2019-10-22 08:56:29,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:29,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:29,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:29,735 INFO L87 Difference]: Start difference. First operand 3235 states and 7430 transitions. Second operand 6 states. [2019-10-22 08:56:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:29,916 INFO L93 Difference]: Finished difference Result 3600 states and 8213 transitions. [2019-10-22 08:56:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:29,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-10-22 08:56:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:29,920 INFO L225 Difference]: With dead ends: 3600 [2019-10-22 08:56:29,920 INFO L226 Difference]: Without dead ends: 3558 [2019-10-22 08:56:29,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2019-10-22 08:56:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3129. [2019-10-22 08:56:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-10-22 08:56:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 7140 transitions. [2019-10-22 08:56:29,961 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 7140 transitions. Word has length 87 [2019-10-22 08:56:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:29,961 INFO L462 AbstractCegarLoop]: Abstraction has 3129 states and 7140 transitions. [2019-10-22 08:56:29,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 7140 transitions. [2019-10-22 08:56:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-22 08:56:29,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:29,965 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:29,965 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:29,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1850809130, now seen corresponding path program 2 times [2019-10-22 08:56:29,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:29,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832087728] [2019-10-22 08:56:29,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:29,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:30,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:30,055 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:56:30,172 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 08:56:30,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:30 BasicIcfg [2019-10-22 08:56:30,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:30,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:30,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:30,174 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:30,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:06" (3/4) ... [2019-10-22 08:56:30,177 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:56:30,306 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_08ccc483-4ab4-4d67-a340-da6fa5eed980/bin/uautomizer/witness.graphml [2019-10-22 08:56:30,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:30,308 INFO L168 Benchmark]: Toolchain (without parser) took 25061.68 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 937.8 MB in the beginning and 1.0 GB in the end (delta: -88.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-10-22 08:56:30,308 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:30,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:30,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:30,309 INFO L168 Benchmark]: Boogie Preprocessor took 30.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:30,309 INFO L168 Benchmark]: RCFGBuilder took 574.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:30,310 INFO L168 Benchmark]: TraceAbstraction took 23706.45 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-10-22 08:56:30,310 INFO L168 Benchmark]: Witness Printer took 131.91 ms. Allocated memory is still 3.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:30,311 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 567.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 574.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23706.45 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 131.91 ms. Allocated memory is still 3.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L809] 0 pthread_t t839; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L810] FCALL, FORK 0 pthread_create(&t839, ((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, a=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] [L811] 0 pthread_t t840; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L812] FCALL, FORK 0 pthread_create(&t840, ((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, a=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=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] [L787] 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, a=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=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] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 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, a=1, 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] [L746] 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, a=1, 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] [L746] 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) [L747] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 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)) [L748] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 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)) [L749] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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))=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] [L749] 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)) [L750] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 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)) [L751] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 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)) [L752] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 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)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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$flush_delayed ? y$mem_tmp : y=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=1] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=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=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L789] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L818] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L818] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L818] 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) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L820] 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 [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. Result: UNSAFE, OverallTime: 23.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5559 SDtfs, 5922 SDslu, 12533 SDs, 0 SdLazy, 3803 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51013occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 44952 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1491 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1383 ConstructedInterpolants, 0 QuantifiedInterpolants, 223068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...