./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/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 5673c8fc999c6c2aa4e3139a5db49468705e6072 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:49:52,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:52,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:52,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:52,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:52,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:52,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:52,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:52,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:52,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:52,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:52,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:52,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:52,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:52,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:52,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:52,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:52,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:52,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:52,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:52,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:52,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:52,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:52,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:52,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:52,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:52,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:52,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:52,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:52,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:52,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:52,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:52,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:52,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:52,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:52,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:52,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:52,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:52,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:52,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:52,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:52,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:52,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:52,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:52,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:52,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:52,337 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:52,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:52,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:52,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:52,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:52,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:52,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:52,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:52,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:52,339 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:52,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:52,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:52,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:52,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:52,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:52,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:52,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:52,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:52,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:52,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:52,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:52,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:52,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:52,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:52,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/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 -> 5673c8fc999c6c2aa4e3139a5db49468705e6072 [2019-11-25 08:49:52,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:52,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:52,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:52,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:52,523 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:52,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-25 08:49:52,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/data/0981b1463/d5e6854a7f1048659a2694509847bfd9/FLAGb40a60dd7 [2019-11-25 08:49:53,042 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:53,043 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/sv-benchmarks/c/pthread-wmm/mix031_pso.opt.i [2019-11-25 08:49:53,057 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/data/0981b1463/d5e6854a7f1048659a2694509847bfd9/FLAGb40a60dd7 [2019-11-25 08:49:53,365 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/data/0981b1463/d5e6854a7f1048659a2694509847bfd9 [2019-11-25 08:49:53,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:53,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:53,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:53,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:53,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:53,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:53,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162dbf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53, skipping insertion in model container [2019-11-25 08:49:53,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:53,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:53,428 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:53,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:53,867 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:53,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:53,991 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:53,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53 WrapperNode [2019-11-25 08:49:53,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:53,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:53,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:53,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:53,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:54,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:54,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:54,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:54,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... [2019-11-25 08:49:54,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:54,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:54,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:54,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:54,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/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-11-25 08:49:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:49:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:49:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:49:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:49:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:49:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:49:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:49:54,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:54,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:54,153 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:49:54,817 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:54,817 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:49:54,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:54 BoogieIcfgContainer [2019-11-25 08:49:54,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:54,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:54,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:54,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:54,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:53" (1/3) ... [2019-11-25 08:49:54,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714f47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:54, skipping insertion in model container [2019-11-25 08:49:54,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:53" (2/3) ... [2019-11-25 08:49:54,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714f47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:54, skipping insertion in model container [2019-11-25 08:49:54,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:54" (3/3) ... [2019-11-25 08:49:54,826 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt.i [2019-11-25 08:49:54,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,898 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,916 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:55,020 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:49:55,020 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:55,027 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:49:55,037 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:49:55,058 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:55,058 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:55,058 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:55,058 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:55,058 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:55,059 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:55,059 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:55,059 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:55,085 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 277 places, 353 transitions [2019-11-25 08:49:56,792 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-11-25 08:49:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-11-25 08:49:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-25 08:49:56,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:56,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:56,804 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash -870107987, now seen corresponding path program 1 times [2019-11-25 08:49:56,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:56,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590889380] [2019-11-25 08:49:56,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:57,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590889380] [2019-11-25 08:49:57,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:57,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:57,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765088276] [2019-11-25 08:49:57,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:57,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:57,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:57,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:57,089 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-11-25 08:49:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:57,976 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-11-25 08:49:57,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:57,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-25 08:49:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,197 INFO L225 Difference]: With dead ends: 26619 [2019-11-25 08:49:58,197 INFO L226 Difference]: Without dead ends: 20363 [2019-11-25 08:49:58,203 INFO L630 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-11-25 08:49:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-11-25 08:49:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-11-25 08:49:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-11-25 08:49:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-11-25 08:49:59,311 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-11-25 08:49:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:59,311 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-11-25 08:49:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-11-25 08:49:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:49:59,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:59,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1372959301, now seen corresponding path program 1 times [2019-11-25 08:49:59,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014739430] [2019-11-25 08:49:59,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:59,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014739430] [2019-11-25 08:49:59,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:59,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:59,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090683955] [2019-11-25 08:49:59,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:59,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:59,447 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-11-25 08:50:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,791 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-11-25 08:50:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:00,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-25 08:50:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,918 INFO L225 Difference]: With dead ends: 31841 [2019-11-25 08:50:00,919 INFO L226 Difference]: Without dead ends: 31289 [2019-11-25 08:50:00,920 INFO L630 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-11-25 08:50:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-11-25 08:50:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-11-25 08:50:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-11-25 08:50:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-11-25 08:50:01,914 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-11-25 08:50:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:01,917 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-11-25 08:50:01,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-11-25 08:50:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:50:02,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:02,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:02,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1695795612, now seen corresponding path program 1 times [2019-11-25 08:50:02,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:02,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293218952] [2019-11-25 08:50:02,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:02,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293218952] [2019-11-25 08:50:02,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:02,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:02,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855764414] [2019-11-25 08:50:02,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:02,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:02,398 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 5 states. [2019-11-25 08:50:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,920 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-11-25 08:50:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:02,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-25 08:50:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:03,077 INFO L225 Difference]: With dead ends: 38699 [2019-11-25 08:50:03,077 INFO L226 Difference]: Without dead ends: 38251 [2019-11-25 08:50:03,078 INFO L630 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-11-25 08:50:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-11-25 08:50:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-11-25 08:50:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-11-25 08:50:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-11-25 08:50:04,220 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-11-25 08:50:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,221 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-11-25 08:50:04,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-11-25 08:50:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:50:04,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,233 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1134070006, now seen corresponding path program 1 times [2019-11-25 08:50:04,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305758353] [2019-11-25 08:50:04,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:04,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305758353] [2019-11-25 08:50:04,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:04,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390259847] [2019-11-25 08:50:04,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:04,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:04,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:04,302 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 3 states. [2019-11-25 08:50:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,966 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-11-25 08:50:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:04,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:50:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:05,135 INFO L225 Difference]: With dead ends: 42415 [2019-11-25 08:50:05,135 INFO L226 Difference]: Without dead ends: 42415 [2019-11-25 08:50:05,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-11-25 08:50:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-11-25 08:50:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-11-25 08:50:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-11-25 08:50:06,014 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-11-25 08:50:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:06,014 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-11-25 08:50:06,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-11-25 08:50:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:50:06,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:06,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:06,034 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:06,035 INFO L82 PathProgramCache]: Analyzing trace with hash 125714386, now seen corresponding path program 1 times [2019-11-25 08:50:06,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:06,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539474355] [2019-11-25 08:50:06,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:06,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539474355] [2019-11-25 08:50:06,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:06,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:06,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549407406] [2019-11-25 08:50:06,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:06,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:06,194 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 6 states. [2019-11-25 08:50:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,389 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-11-25 08:50:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:07,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-25 08:50:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,511 INFO L225 Difference]: With dead ends: 51814 [2019-11-25 08:50:07,511 INFO L226 Difference]: Without dead ends: 51014 [2019-11-25 08:50:07,512 INFO L630 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-11-25 08:50:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-11-25 08:50:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-11-25 08:50:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-11-25 08:50:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-11-25 08:50:08,559 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-11-25 08:50:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,559 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-11-25 08:50:08,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-11-25 08:50:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:50:08,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:08,578 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1671236973, now seen corresponding path program 1 times [2019-11-25 08:50:08,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352488150] [2019-11-25 08:50:08,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:08,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352488150] [2019-11-25 08:50:08,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:08,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897825240] [2019-11-25 08:50:08,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:08,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:08,703 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 7 states. [2019-11-25 08:50:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,810 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-11-25 08:50:09,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:50:09,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-25 08:50:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,948 INFO L225 Difference]: With dead ends: 68550 [2019-11-25 08:50:09,948 INFO L226 Difference]: Without dead ends: 68550 [2019-11-25 08:50:09,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:50:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-11-25 08:50:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-11-25 08:50:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-11-25 08:50:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-11-25 08:50:11,637 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-11-25 08:50:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,637 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-11-25 08:50:11,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-11-25 08:50:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:50:11,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,652 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,653 INFO L82 PathProgramCache]: Analyzing trace with hash -783733292, now seen corresponding path program 1 times [2019-11-25 08:50:11,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464145978] [2019-11-25 08:50:11,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:11,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464145978] [2019-11-25 08:50:11,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678425365] [2019-11-25 08:50:11,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,736 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-11-25 08:50:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,791 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-11-25 08:50:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:11,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-25 08:50:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,803 INFO L225 Difference]: With dead ends: 10469 [2019-11-25 08:50:11,803 INFO L226 Difference]: Without dead ends: 9223 [2019-11-25 08:50:11,803 INFO L630 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-11-25 08:50:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-11-25 08:50:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-11-25 08:50:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-11-25 08:50:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-11-25 08:50:11,917 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-11-25 08:50:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,917 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-11-25 08:50:11,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-11-25 08:50:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:50:11,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash -800467883, now seen corresponding path program 1 times [2019-11-25 08:50:11,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482710553] [2019-11-25 08:50:11,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:11,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482710553] [2019-11-25 08:50:11,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:11,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445710609] [2019-11-25 08:50:11,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:11,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:11,992 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 6 states. [2019-11-25 08:50:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,448 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-11-25 08:50:12,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:50:12,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-25 08:50:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,465 INFO L225 Difference]: With dead ends: 11222 [2019-11-25 08:50:12,466 INFO L226 Difference]: Without dead ends: 11135 [2019-11-25 08:50:12,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-11-25 08:50:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-11-25 08:50:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-11-25 08:50:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-11-25 08:50:12,614 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-11-25 08:50:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,615 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-11-25 08:50:12,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-11-25 08:50:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:50:12,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:12,620 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1357400536, now seen corresponding path program 1 times [2019-11-25 08:50:12,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116648412] [2019-11-25 08:50:12,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:12,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116648412] [2019-11-25 08:50:12,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:12,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143962629] [2019-11-25 08:50:12,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:12,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:12,701 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 4 states. [2019-11-25 08:50:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,878 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-11-25 08:50:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:12,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-25 08:50:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,897 INFO L225 Difference]: With dead ends: 10891 [2019-11-25 08:50:12,898 INFO L226 Difference]: Without dead ends: 10891 [2019-11-25 08:50:12,898 INFO L630 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-11-25 08:50:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-11-25 08:50:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-11-25 08:50:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-11-25 08:50:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-11-25 08:50:13,077 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-11-25 08:50:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,077 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-11-25 08:50:13,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-11-25 08:50:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:50:13,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,085 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash 385409799, now seen corresponding path program 1 times [2019-11-25 08:50:13,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309527575] [2019-11-25 08:50:13,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:13,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309527575] [2019-11-25 08:50:13,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:13,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86202011] [2019-11-25 08:50:13,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:13,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:13,164 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 6 states. [2019-11-25 08:50:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,678 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-11-25 08:50:13,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:50:13,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-25 08:50:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,700 INFO L225 Difference]: With dead ends: 12789 [2019-11-25 08:50:13,700 INFO L226 Difference]: Without dead ends: 12741 [2019-11-25 08:50:13,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:50:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-11-25 08:50:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-11-25 08:50:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-11-25 08:50:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-11-25 08:50:13,902 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-11-25 08:50:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,903 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-11-25 08:50:13,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-11-25 08:50:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:13,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,918 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2019249902, now seen corresponding path program 1 times [2019-11-25 08:50:13,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969033346] [2019-11-25 08:50:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:14,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969033346] [2019-11-25 08:50:14,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:14,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616392812] [2019-11-25 08:50:14,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:14,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:14,103 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-11-25 08:50:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,330 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-11-25 08:50:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:14,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:50:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,347 INFO L225 Difference]: With dead ends: 13324 [2019-11-25 08:50:14,347 INFO L226 Difference]: Without dead ends: 13324 [2019-11-25 08:50:14,348 INFO L630 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-11-25 08:50:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-11-25 08:50:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-11-25 08:50:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-11-25 08:50:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-11-25 08:50:14,516 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-11-25 08:50:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,516 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-11-25 08:50:14,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-11-25 08:50:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:14,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash 198508051, now seen corresponding path program 1 times [2019-11-25 08:50:14,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800366566] [2019-11-25 08:50:14,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:14,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800366566] [2019-11-25 08:50:14,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226582876] [2019-11-25 08:50:14,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,571 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-11-25 08:50:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,787 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-11-25 08:50:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-25 08:50:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,804 INFO L225 Difference]: With dead ends: 12704 [2019-11-25 08:50:14,805 INFO L226 Difference]: Without dead ends: 12704 [2019-11-25 08:50:14,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-11-25 08:50:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-11-25 08:50:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-11-25 08:50:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-11-25 08:50:14,985 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-11-25 08:50:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,985 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-11-25 08:50:14,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-11-25 08:50:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:14,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -898304257, now seen corresponding path program 1 times [2019-11-25 08:50:14,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114689650] [2019-11-25 08:50:14,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:15,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114689650] [2019-11-25 08:50:15,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:15,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:15,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025986490] [2019-11-25 08:50:15,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:15,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:15,105 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-11-25 08:50:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:15,692 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-11-25 08:50:15,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:15,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-25 08:50:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:15,715 INFO L225 Difference]: With dead ends: 13737 [2019-11-25 08:50:15,716 INFO L226 Difference]: Without dead ends: 13737 [2019-11-25 08:50:15,716 INFO L630 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-11-25 08:50:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-11-25 08:50:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-11-25 08:50:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-25 08:50:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-11-25 08:50:15,914 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-11-25 08:50:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:15,914 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-11-25 08:50:15,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-11-25 08:50:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:15,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:15,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:15,927 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1319453696, now seen corresponding path program 1 times [2019-11-25 08:50:15,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:15,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212567702] [2019-11-25 08:50:15,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:16,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212567702] [2019-11-25 08:50:16,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:16,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:16,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526657009] [2019-11-25 08:50:16,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:16,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:16,061 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-11-25 08:50:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:16,397 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-11-25 08:50:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:50:16,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-25 08:50:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:16,419 INFO L225 Difference]: With dead ends: 15574 [2019-11-25 08:50:16,419 INFO L226 Difference]: Without dead ends: 15574 [2019-11-25 08:50:16,420 INFO L630 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-11-25 08:50:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-11-25 08:50:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-11-25 08:50:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-11-25 08:50:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-11-25 08:50:16,603 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-11-25 08:50:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:16,604 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-11-25 08:50:16,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-11-25 08:50:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:16,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:16,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:16,616 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1530804609, now seen corresponding path program 1 times [2019-11-25 08:50:16,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:16,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141519821] [2019-11-25 08:50:16,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:16,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141519821] [2019-11-25 08:50:16,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:16,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:16,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049246185] [2019-11-25 08:50:16,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:16,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:16,681 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-11-25 08:50:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:16,923 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-11-25 08:50:16,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:16,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:50:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:16,944 INFO L225 Difference]: With dead ends: 17386 [2019-11-25 08:50:16,944 INFO L226 Difference]: Without dead ends: 17386 [2019-11-25 08:50:16,945 INFO L630 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-11-25 08:50:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-11-25 08:50:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-11-25 08:50:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-11-25 08:50:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-11-25 08:50:17,147 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-11-25 08:50:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:17,147 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-11-25 08:50:17,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-11-25 08:50:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:17,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:17,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:17,156 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1020270432, now seen corresponding path program 1 times [2019-11-25 08:50:17,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:17,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526107359] [2019-11-25 08:50:17,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:17,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526107359] [2019-11-25 08:50:17,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:17,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:17,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702146095] [2019-11-25 08:50:17,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:17,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:17,238 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-11-25 08:50:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:17,592 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-11-25 08:50:17,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:17,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:50:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:17,614 INFO L225 Difference]: With dead ends: 19768 [2019-11-25 08:50:17,614 INFO L226 Difference]: Without dead ends: 19768 [2019-11-25 08:50:17,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-11-25 08:50:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-11-25 08:50:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-11-25 08:50:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-11-25 08:50:17,833 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-11-25 08:50:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:17,833 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-11-25 08:50:17,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-11-25 08:50:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:17,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:17,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:17,842 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -787184031, now seen corresponding path program 1 times [2019-11-25 08:50:17,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:17,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231298531] [2019-11-25 08:50:17,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:17,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231298531] [2019-11-25 08:50:17,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:17,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:17,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484061683] [2019-11-25 08:50:17,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:17,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:17,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:17,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:17,900 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-11-25 08:50:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:18,356 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-11-25 08:50:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:18,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-25 08:50:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:18,381 INFO L225 Difference]: With dead ends: 20664 [2019-11-25 08:50:18,381 INFO L226 Difference]: Without dead ends: 20388 [2019-11-25 08:50:18,381 INFO L630 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-11-25 08:50:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-11-25 08:50:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-11-25 08:50:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-11-25 08:50:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-11-25 08:50:18,636 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-11-25 08:50:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:18,637 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-11-25 08:50:18,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-11-25 08:50:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:18,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:18,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:18,649 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:18,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1710831906, now seen corresponding path program 1 times [2019-11-25 08:50:18,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:18,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652128921] [2019-11-25 08:50:18,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:18,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652128921] [2019-11-25 08:50:18,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:18,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-25 08:50:18,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036130707] [2019-11-25 08:50:18,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:50:18,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:50:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:50:18,805 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-11-25 08:50:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:19,612 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-11-25 08:50:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:50:19,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-11-25 08:50:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:19,637 INFO L225 Difference]: With dead ends: 24278 [2019-11-25 08:50:19,637 INFO L226 Difference]: Without dead ends: 24278 [2019-11-25 08:50:19,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:50:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-11-25 08:50:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-11-25 08:50:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-11-25 08:50:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-11-25 08:50:19,886 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-11-25 08:50:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:19,887 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-11-25 08:50:19,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:50:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-11-25 08:50:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:50:19,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:19,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:19,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:19,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:19,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1696631709, now seen corresponding path program 1 times [2019-11-25 08:50:19,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:19,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653737954] [2019-11-25 08:50:19,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:19,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653737954] [2019-11-25 08:50:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:19,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:19,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70484675] [2019-11-25 08:50:19,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:19,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:19,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:19,970 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-11-25 08:50:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:20,035 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-11-25 08:50:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:20,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:50:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:20,042 INFO L225 Difference]: With dead ends: 6192 [2019-11-25 08:50:20,042 INFO L226 Difference]: Without dead ends: 5020 [2019-11-25 08:50:20,042 INFO L630 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-11-25 08:50:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-11-25 08:50:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-11-25 08:50:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-11-25 08:50:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-11-25 08:50:20,152 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-11-25 08:50:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:20,153 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-11-25 08:50:20,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-11-25 08:50:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:20,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:20,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:20,158 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash -704066716, now seen corresponding path program 1 times [2019-11-25 08:50:20,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:20,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920901278] [2019-11-25 08:50:20,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:20,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920901278] [2019-11-25 08:50:20,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:20,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:20,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943931064] [2019-11-25 08:50:20,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:20,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:20,223 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 5 states. [2019-11-25 08:50:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:20,419 INFO L93 Difference]: Finished difference Result 4936 states and 11181 transitions. [2019-11-25 08:50:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:20,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-25 08:50:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:20,424 INFO L225 Difference]: With dead ends: 4936 [2019-11-25 08:50:20,424 INFO L226 Difference]: Without dead ends: 4905 [2019-11-25 08:50:20,425 INFO L630 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-11-25 08:50:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-11-25 08:50:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4420. [2019-11-25 08:50:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-11-25 08:50:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 10099 transitions. [2019-11-25 08:50:20,469 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 10099 transitions. Word has length 86 [2019-11-25 08:50:20,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:20,469 INFO L462 AbstractCegarLoop]: Abstraction has 4420 states and 10099 transitions. [2019-11-25 08:50:20,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 10099 transitions. [2019-11-25 08:50:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:20,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:20,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:20,475 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 644532785, now seen corresponding path program 1 times [2019-11-25 08:50:20,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:20,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976642726] [2019-11-25 08:50:20,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:20,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976642726] [2019-11-25 08:50:20,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:20,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:20,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486889965] [2019-11-25 08:50:20,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:20,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:20,589 INFO L87 Difference]: Start difference. First operand 4420 states and 10099 transitions. Second operand 7 states. [2019-11-25 08:50:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:20,899 INFO L93 Difference]: Finished difference Result 5530 states and 12573 transitions. [2019-11-25 08:50:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:50:20,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:50:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:20,904 INFO L225 Difference]: With dead ends: 5530 [2019-11-25 08:50:20,904 INFO L226 Difference]: Without dead ends: 5512 [2019-11-25 08:50:20,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:50:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2019-11-25 08:50:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4565. [2019-11-25 08:50:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4565 states. [2019-11-25 08:50:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 10427 transitions. [2019-11-25 08:50:20,954 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 10427 transitions. Word has length 86 [2019-11-25 08:50:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 4565 states and 10427 transitions. [2019-11-25 08:50:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 10427 transitions. [2019-11-25 08:50:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:20,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:20,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:20,960 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1152418574, now seen corresponding path program 1 times [2019-11-25 08:50:20,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:20,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061294005] [2019-11-25 08:50:20,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:21,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061294005] [2019-11-25 08:50:21,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:21,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:21,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531634691] [2019-11-25 08:50:21,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:21,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:21,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:21,072 INFO L87 Difference]: Start difference. First operand 4565 states and 10427 transitions. Second operand 6 states. [2019-11-25 08:50:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:21,224 INFO L93 Difference]: Finished difference Result 4403 states and 9941 transitions. [2019-11-25 08:50:21,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:21,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:50:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:21,228 INFO L225 Difference]: With dead ends: 4403 [2019-11-25 08:50:21,228 INFO L226 Difference]: Without dead ends: 4403 [2019-11-25 08:50:21,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2019-11-25 08:50:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3069. [2019-11-25 08:50:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3069 states. [2019-11-25 08:50:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 7023 transitions. [2019-11-25 08:50:21,265 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 7023 transitions. Word has length 86 [2019-11-25 08:50:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:21,266 INFO L462 AbstractCegarLoop]: Abstraction has 3069 states and 7023 transitions. [2019-11-25 08:50:21,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 7023 transitions. [2019-11-25 08:50:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:21,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:21,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:21,269 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1161956523, now seen corresponding path program 1 times [2019-11-25 08:50:21,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:21,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350624254] [2019-11-25 08:50:21,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:21,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350624254] [2019-11-25 08:50:21,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:50:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307506549] [2019-11-25 08:50:21,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:50:21,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:50:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:21,460 INFO L87 Difference]: Start difference. First operand 3069 states and 7023 transitions. Second operand 8 states. [2019-11-25 08:50:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:21,740 INFO L93 Difference]: Finished difference Result 3569 states and 8090 transitions. [2019-11-25 08:50:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:50:21,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-25 08:50:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:21,743 INFO L225 Difference]: With dead ends: 3569 [2019-11-25 08:50:21,743 INFO L226 Difference]: Without dead ends: 3569 [2019-11-25 08:50:21,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:50:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2019-11-25 08:50:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3168. [2019-11-25 08:50:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-25 08:50:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7228 transitions. [2019-11-25 08:50:21,770 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7228 transitions. Word has length 88 [2019-11-25 08:50:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:21,770 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7228 transitions. [2019-11-25 08:50:21,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:50:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7228 transitions. [2019-11-25 08:50:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:21,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:21,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:21,774 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:21,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:21,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2049460204, now seen corresponding path program 1 times [2019-11-25 08:50:21,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:21,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132715196] [2019-11-25 08:50:21,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:21,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132715196] [2019-11-25 08:50:21,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:21,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:21,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052340070] [2019-11-25 08:50:21,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:21,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:21,869 INFO L87 Difference]: Start difference. First operand 3168 states and 7228 transitions. Second operand 7 states. [2019-11-25 08:50:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:21,971 INFO L93 Difference]: Finished difference Result 5381 states and 12355 transitions. [2019-11-25 08:50:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:21,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-11-25 08:50:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:21,974 INFO L225 Difference]: With dead ends: 5381 [2019-11-25 08:50:21,974 INFO L226 Difference]: Without dead ends: 2305 [2019-11-25 08:50:21,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:50:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-11-25 08:50:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-11-25 08:50:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-11-25 08:50:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5276 transitions. [2019-11-25 08:50:21,997 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5276 transitions. Word has length 88 [2019-11-25 08:50:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:21,997 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5276 transitions. [2019-11-25 08:50:21,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5276 transitions. [2019-11-25 08:50:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:21,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:21,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:21,999 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 502510154, now seen corresponding path program 2 times [2019-11-25 08:50:21,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:21,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666761462] [2019-11-25 08:50:22,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:22,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666761462] [2019-11-25 08:50:22,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:22,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:50:22,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712880520] [2019-11-25 08:50:22,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:50:22,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:22,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:50:22,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:50:22,147 INFO L87 Difference]: Start difference. First operand 2305 states and 5276 transitions. Second operand 10 states. [2019-11-25 08:50:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:22,395 INFO L93 Difference]: Finished difference Result 3951 states and 9033 transitions. [2019-11-25 08:50:22,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:50:22,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-25 08:50:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:22,398 INFO L225 Difference]: With dead ends: 3951 [2019-11-25 08:50:22,398 INFO L226 Difference]: Without dead ends: 2572 [2019-11-25 08:50:22,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:50:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-25 08:50:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2342. [2019-11-25 08:50:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2019-11-25 08:50:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 5307 transitions. [2019-11-25 08:50:22,415 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 5307 transitions. Word has length 88 [2019-11-25 08:50:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:22,415 INFO L462 AbstractCegarLoop]: Abstraction has 2342 states and 5307 transitions. [2019-11-25 08:50:22,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:50:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 5307 transitions. [2019-11-25 08:50:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:50:22,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:22,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:50:22,417 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1568953738, now seen corresponding path program 3 times [2019-11-25 08:50:22,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:22,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699799736] [2019-11-25 08:50:22,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:22,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:22,485 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:50:22,635 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:50:22,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:22 BasicIcfg [2019-11-25 08:50:22,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:22,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:22,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:22,638 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:22,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:54" (3/4) ... [2019-11-25 08:50:22,640 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:50:22,793 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7c6ac29c-a720-43f5-86b2-e9ccde387de4/bin/uautomizer/witness.graphml [2019-11-25 08:50:22,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:22,795 INFO L168 Benchmark]: Toolchain (without parser) took 29425.89 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -532.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-25 08:50:22,795 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:22,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:22,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.87 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:22,796 INFO L168 Benchmark]: Boogie Preprocessor took 38.71 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-11-25 08:50:22,797 INFO L168 Benchmark]: RCFGBuilder took 737.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:22,797 INFO L168 Benchmark]: TraceAbstraction took 27817.43 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -524.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-25 08:50:22,797 INFO L168 Benchmark]: Witness Printer took 155.97 ms. Allocated memory is still 3.1 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 88.8 MB). Peak memory consumption was 88.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:22,800 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.87 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.71 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 737.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27817.43 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -524.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 155.97 ms. Allocated memory is still 3.1 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 88.8 MB). Peak memory consumption was 88.8 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] [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 [!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=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=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 [!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=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=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 [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=0, 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=0, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$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=0, 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=0, 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=0, 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=0, 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=0, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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 9 procedures, 331 locations, 5 error locations. Result: UNSAFE, OverallTime: 27.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6650 SDtfs, 7264 SDslu, 15474 SDs, 0 SdLazy, 5933 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 50848 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1803 NumberOfCodeBlocks, 1803 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1690 ConstructedInterpolants, 0 QuantifiedInterpolants, 311584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...