./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/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 ba285cceecb5b920bb647903ab6e1e54ede4b67e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:22:26,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:22:26,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:22:26,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:22:26,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:22:26,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:22:26,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:22:26,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:22:26,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:22:26,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:22:26,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:22:26,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:22:26,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:22:26,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:22:26,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:22:26,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:22:26,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:22:26,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:22:26,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:22:26,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:22:26,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:22:26,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:22:26,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:22:26,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:22:26,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:22:26,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:22:26,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:22:26,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:22:26,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:22:26,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:22:26,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:22:26,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:22:26,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:22:26,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:22:26,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:22:26,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:22:26,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:22:26,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:22:26,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:22:26,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:22:26,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:22:26,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:22:26,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:22:26,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:22:26,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:22:26,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:22:26,320 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:22:26,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:22:26,320 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:22:26,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:22:26,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:22:26,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:22:26,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:22:26,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:22:26,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:22:26,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:22:26,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:22:26,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:22:26,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:22:26,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:22:26,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:22:26,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:22:26,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:22:26,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:22:26,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:22:26,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:22:26,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:22:26,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:22:26,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:22:26,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:22:26,325 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_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/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 -> ba285cceecb5b920bb647903ab6e1e54ede4b67e [2019-11-15 20:22:26,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:22:26,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:22:26,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:22:26,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:22:26,384 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:22:26,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i [2019-11-15 20:22:26,446 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/data/ebc68ddeb/0c650d69170441deaa15ce0c8d653ef9/FLAGa333f62f8 [2019-11-15 20:22:26,898 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:22:26,899 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i [2019-11-15 20:22:26,918 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/data/ebc68ddeb/0c650d69170441deaa15ce0c8d653ef9/FLAGa333f62f8 [2019-11-15 20:22:27,182 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/data/ebc68ddeb/0c650d69170441deaa15ce0c8d653ef9 [2019-11-15 20:22:27,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:22:27,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:22:27,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:22:27,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:22:27,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:22:27,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:27,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c890f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27, skipping insertion in model container [2019-11-15 20:22:27,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:27,202 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:22:27,247 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:22:27,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:22:27,751 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:22:27,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:22:27,911 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:22:27,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27 WrapperNode [2019-11-15 20:22:27,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:22:27,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:22:27,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:22:27,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:22:27,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:27,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:27,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:22:27,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:22:27,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:22:27,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:22:28,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... [2019-11-15 20:22:28,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:22:28,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:22:28,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:22:28,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:22:28,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/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-15 20:22:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:22:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:22:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:22:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:22:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:22:28,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:22:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:22:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:22:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:22:28,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:22:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:22:28,091 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:22:28,802 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:22:28,803 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:22:28,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:22:28 BoogieIcfgContainer [2019-11-15 20:22:28,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:22:28,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:22:28,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:22:28,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:22:28,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:22:27" (1/3) ... [2019-11-15 20:22:28,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b9f782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:22:28, skipping insertion in model container [2019-11-15 20:22:28,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:22:27" (2/3) ... [2019-11-15 20:22:28,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b9f782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:22:28, skipping insertion in model container [2019-11-15 20:22:28,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:22:28" (3/3) ... [2019-11-15 20:22:28,810 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt.i [2019-11-15 20:22:28,854 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,854 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,855 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,856 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,857 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,858 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,858 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,858 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,858 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,858 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,859 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,859 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,859 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,859 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,859 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,861 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,862 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,862 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,862 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,863 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,864 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,865 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,866 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,867 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,868 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,869 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,869 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,869 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,869 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,869 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,870 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,870 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,870 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,870 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,870 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,870 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,871 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,871 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,871 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,871 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,871 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,872 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,872 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,872 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,872 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,872 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,872 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,873 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,873 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,873 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,873 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,873 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,874 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,874 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,874 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,874 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,874 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,875 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,875 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,875 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,875 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,875 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,876 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,876 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,876 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,876 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,876 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,876 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,877 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,877 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,877 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,877 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,877 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,877 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,878 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,878 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,878 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,878 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,878 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,879 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,879 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,879 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,879 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,879 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,879 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,880 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,880 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,880 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,880 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,880 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,881 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,881 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,881 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,881 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,881 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,881 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,882 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,882 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,882 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,882 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:22:28,895 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:22:28,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:22:28,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:22:28,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:22:28,927 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:22:28,927 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:22:28,928 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:22:28,928 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:22:28,928 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:22:28,928 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:22:28,928 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:22:28,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:22:28,940 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 20:22:31,369 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 20:22:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 20:22:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 20:22:31,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:31,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:31,381 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1414647361, now seen corresponding path program 1 times [2019-11-15 20:22:31,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:31,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627754787] [2019-11-15 20:22:31,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:31,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:31,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:31,627 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-15 20:22:31,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627754787] [2019-11-15 20:22:31,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:31,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:22:31,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891958516] [2019-11-15 20:22:31,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:22:31,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:22:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:22:31,650 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 20:22:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:32,684 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 20:22:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:22:32,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 20:22:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:32,935 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 20:22:32,935 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 20:22:32,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:22:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 20:22:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 20:22:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 20:22:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 20:22:34,478 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 20:22:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:34,479 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 20:22:34,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:22:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 20:22:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:22:34,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:34,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:34,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1018218352, now seen corresponding path program 1 times [2019-11-15 20:22:34,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:34,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981077576] [2019-11-15 20:22:34,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:34,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:34,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:34,598 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-15 20:22:34,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981077576] [2019-11-15 20:22:34,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:34,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:34,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887331772] [2019-11-15 20:22:34,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:34,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:34,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:34,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:34,601 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 20:22:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:35,601 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 20:22:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:22:35,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 20:22:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:35,771 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 20:22:35,771 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 20:22:35,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:22:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 20:22:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 20:22:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 20:22:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 20:22:37,317 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 20:22:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:37,318 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 20:22:37,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 20:22:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:22:37,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:37,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:37,332 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 352520797, now seen corresponding path program 1 times [2019-11-15 20:22:37,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:37,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502889956] [2019-11-15 20:22:37,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:37,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:37,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:37,436 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-15 20:22:37,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502889956] [2019-11-15 20:22:37,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:37,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:37,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877190911] [2019-11-15 20:22:37,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:37,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:37,439 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 20:22:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:38,580 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 20:22:38,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:22:38,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 20:22:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:38,815 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 20:22:38,815 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 20:22:38,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:22:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 20:22:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 20:22:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 20:22:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 20:22:39,988 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 20:22:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:39,989 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 20:22:39,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 20:22:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 20:22:40,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:40,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:40,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:40,001 INFO L82 PathProgramCache]: Analyzing trace with hash 441299907, now seen corresponding path program 1 times [2019-11-15 20:22:40,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:40,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473125650] [2019-11-15 20:22:40,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:40,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:40,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:40,055 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-15 20:22:40,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473125650] [2019-11-15 20:22:40,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:40,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:22:40,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50832483] [2019-11-15 20:22:40,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:22:40,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:22:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:22:40,057 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 20:22:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:41,007 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 20:22:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:22:41,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 20:22:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:41,183 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 20:22:41,183 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 20:22:41,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:22:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 20:22:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 20:22:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 20:22:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 20:22:42,359 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 20:22:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:42,360 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 20:22:42,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:22:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 20:22:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:22:42,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:42,378 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:42,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2076880242, now seen corresponding path program 1 times [2019-11-15 20:22:42,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:42,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863530834] [2019-11-15 20:22:42,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:42,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:42,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:22:42,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863530834] [2019-11-15 20:22:42,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:42,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:22:42,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551851687] [2019-11-15 20:22:42,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:22:42,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:22:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:22:42,484 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 20:22:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:44,040 INFO L93 Difference]: Finished difference Result 61593 states and 219936 transitions. [2019-11-15 20:22:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:22:44,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:22:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:44,206 INFO L225 Difference]: With dead ends: 61593 [2019-11-15 20:22:44,206 INFO L226 Difference]: Without dead ends: 61025 [2019-11-15 20:22:44,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:22:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61025 states. [2019-11-15 20:22:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61025 to 47875. [2019-11-15 20:22:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47875 states. [2019-11-15 20:22:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47875 states to 47875 states and 174134 transitions. [2019-11-15 20:22:45,161 INFO L78 Accepts]: Start accepts. Automaton has 47875 states and 174134 transitions. Word has length 52 [2019-11-15 20:22:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:45,162 INFO L462 AbstractCegarLoop]: Abstraction has 47875 states and 174134 transitions. [2019-11-15 20:22:45,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:22:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 47875 states and 174134 transitions. [2019-11-15 20:22:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:22:45,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:45,178 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:45,178 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash -995861021, now seen corresponding path program 1 times [2019-11-15 20:22:45,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:45,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681366596] [2019-11-15 20:22:45,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:45,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:45,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:22:45,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681366596] [2019-11-15 20:22:45,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:45,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:22:45,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386259749] [2019-11-15 20:22:45,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:22:45,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:22:45,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:22:45,305 INFO L87 Difference]: Start difference. First operand 47875 states and 174134 transitions. Second operand 6 states. [2019-11-15 20:22:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:46,349 INFO L93 Difference]: Finished difference Result 64221 states and 231062 transitions. [2019-11-15 20:22:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:22:46,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:22:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:46,484 INFO L225 Difference]: With dead ends: 64221 [2019-11-15 20:22:46,485 INFO L226 Difference]: Without dead ends: 64221 [2019-11-15 20:22:46,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:22:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64221 states. [2019-11-15 20:22:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64221 to 60245. [2019-11-15 20:22:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60245 states. [2019-11-15 20:22:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60245 states to 60245 states and 216821 transitions. [2019-11-15 20:22:50,610 INFO L78 Accepts]: Start accepts. Automaton has 60245 states and 216821 transitions. Word has length 52 [2019-11-15 20:22:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:50,611 INFO L462 AbstractCegarLoop]: Abstraction has 60245 states and 216821 transitions. [2019-11-15 20:22:50,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:22:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 60245 states and 216821 transitions. [2019-11-15 20:22:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:22:50,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:50,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:50,629 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:50,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1502154916, now seen corresponding path program 1 times [2019-11-15 20:22:50,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:50,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720557611] [2019-11-15 20:22:50,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:50,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:50,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:50,740 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-15 20:22:50,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720557611] [2019-11-15 20:22:50,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:50,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:50,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585568338] [2019-11-15 20:22:50,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:50,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:50,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:50,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:50,743 INFO L87 Difference]: Start difference. First operand 60245 states and 216821 transitions. Second operand 5 states. [2019-11-15 20:22:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:50,864 INFO L93 Difference]: Finished difference Result 12808 states and 39725 transitions. [2019-11-15 20:22:50,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:22:50,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-15 20:22:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:50,887 INFO L225 Difference]: With dead ends: 12808 [2019-11-15 20:22:50,888 INFO L226 Difference]: Without dead ends: 11096 [2019-11-15 20:22:50,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:22:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11096 states. [2019-11-15 20:22:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11096 to 11047. [2019-11-15 20:22:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-11-15 20:22:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-11-15 20:22:51,101 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-11-15 20:22:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:51,102 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-11-15 20:22:51,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-11-15 20:22:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:22:51,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:51,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:51,108 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:51,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:51,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1137223062, now seen corresponding path program 1 times [2019-11-15 20:22:51,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:51,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478568447] [2019-11-15 20:22:51,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:51,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:51,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:51,211 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-15 20:22:51,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478568447] [2019-11-15 20:22:51,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:51,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:22:51,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555198271] [2019-11-15 20:22:51,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:22:51,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:51,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:22:51,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:22:51,214 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-11-15 20:22:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:51,387 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-11-15 20:22:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:22:51,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:22:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:51,415 INFO L225 Difference]: With dead ends: 12861 [2019-11-15 20:22:51,416 INFO L226 Difference]: Without dead ends: 12861 [2019-11-15 20:22:51,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-11-15 20:22:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-11-15 20:22:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-11-15 20:22:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-11-15 20:22:51,628 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-11-15 20:22:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:51,629 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-11-15 20:22:51,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:22:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-11-15 20:22:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:22:51,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:51,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:51,633 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 605587273, now seen corresponding path program 1 times [2019-11-15 20:22:51,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:51,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167084071] [2019-11-15 20:22:51,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:51,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:51,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:51,752 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-15 20:22:51,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167084071] [2019-11-15 20:22:51,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:51,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:22:51,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387728594] [2019-11-15 20:22:51,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:22:51,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:22:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:22:51,757 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-11-15 20:22:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:52,871 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-11-15 20:22:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:22:52,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 20:22:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:52,892 INFO L225 Difference]: With dead ends: 14218 [2019-11-15 20:22:52,892 INFO L226 Difference]: Without dead ends: 14157 [2019-11-15 20:22:52,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:22:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-11-15 20:22:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-11-15 20:22:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-11-15 20:22:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-11-15 20:22:53,085 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-11-15 20:22:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:53,085 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-11-15 20:22:53,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:22:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-11-15 20:22:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 20:22:53,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:53,092 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:53,092 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:53,093 INFO L82 PathProgramCache]: Analyzing trace with hash -386360045, now seen corresponding path program 1 times [2019-11-15 20:22:53,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:53,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741200595] [2019-11-15 20:22:53,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:53,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:53,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:53,168 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-15 20:22:53,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741200595] [2019-11-15 20:22:53,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:53,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:22:53,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383844391] [2019-11-15 20:22:53,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:22:53,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:22:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:22:53,170 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-11-15 20:22:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:53,533 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-11-15 20:22:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:22:53,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 20:22:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:53,558 INFO L225 Difference]: With dead ends: 16502 [2019-11-15 20:22:53,558 INFO L226 Difference]: Without dead ends: 16502 [2019-11-15 20:22:53,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:22:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-11-15 20:22:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-11-15 20:22:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-11-15 20:22:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-11-15 20:22:53,779 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-11-15 20:22:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:53,780 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-11-15 20:22:53,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:22:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-11-15 20:22:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 20:22:53,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:53,792 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:53,792 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:53,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1831397908, now seen corresponding path program 1 times [2019-11-15 20:22:53,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:53,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936425095] [2019-11-15 20:22:53,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:53,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:53,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:53,894 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-15 20:22:53,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936425095] [2019-11-15 20:22:53,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:53,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:22:53,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099145147] [2019-11-15 20:22:53,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:22:53,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:22:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:22:53,896 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-11-15 20:22:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:54,234 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-11-15 20:22:54,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:22:54,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 20:22:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:54,266 INFO L225 Difference]: With dead ends: 15529 [2019-11-15 20:22:54,266 INFO L226 Difference]: Without dead ends: 15529 [2019-11-15 20:22:54,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:22:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-15 20:22:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-11-15 20:22:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-11-15 20:22:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-11-15 20:22:54,495 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-11-15 20:22:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:54,496 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-11-15 20:22:54,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:22:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-11-15 20:22:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:22:54,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:54,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:54,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash -55827014, now seen corresponding path program 1 times [2019-11-15 20:22:54,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:54,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413477713] [2019-11-15 20:22:54,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:54,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:54,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:54,549 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-15 20:22:54,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413477713] [2019-11-15 20:22:54,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:54,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:22:54,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735253085] [2019-11-15 20:22:54,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:22:54,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:22:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:22:54,552 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 3 states. [2019-11-15 20:22:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:54,663 INFO L93 Difference]: Finished difference Result 19973 states and 59414 transitions. [2019-11-15 20:22:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:22:54,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 20:22:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:54,702 INFO L225 Difference]: With dead ends: 19973 [2019-11-15 20:22:54,703 INFO L226 Difference]: Without dead ends: 19973 [2019-11-15 20:22:54,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:22:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-11-15 20:22:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 15169. [2019-11-15 20:22:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15169 states. [2019-11-15 20:22:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15169 states to 15169 states and 44681 transitions. [2019-11-15 20:22:54,973 INFO L78 Accepts]: Start accepts. Automaton has 15169 states and 44681 transitions. Word has length 66 [2019-11-15 20:22:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:54,973 INFO L462 AbstractCegarLoop]: Abstraction has 15169 states and 44681 transitions. [2019-11-15 20:22:54,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:22:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15169 states and 44681 transitions. [2019-11-15 20:22:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:22:54,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:54,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:54,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1183419736, now seen corresponding path program 1 times [2019-11-15 20:22:54,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:54,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059007659] [2019-11-15 20:22:54,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:54,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:54,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:55,111 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-15 20:22:55,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059007659] [2019-11-15 20:22:55,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:55,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:22:55,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896997934] [2019-11-15 20:22:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:22:55,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:22:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:22:55,113 INFO L87 Difference]: Start difference. First operand 15169 states and 44681 transitions. Second operand 6 states. [2019-11-15 20:22:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:55,984 INFO L93 Difference]: Finished difference Result 16152 states and 46959 transitions. [2019-11-15 20:22:55,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:22:55,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:22:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:56,011 INFO L225 Difference]: With dead ends: 16152 [2019-11-15 20:22:56,011 INFO L226 Difference]: Without dead ends: 16152 [2019-11-15 20:22:56,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:22:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2019-11-15 20:22:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 15734. [2019-11-15 20:22:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15734 states. [2019-11-15 20:22:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15734 states to 15734 states and 45914 transitions. [2019-11-15 20:22:56,235 INFO L78 Accepts]: Start accepts. Automaton has 15734 states and 45914 transitions. Word has length 66 [2019-11-15 20:22:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:56,235 INFO L462 AbstractCegarLoop]: Abstraction has 15734 states and 45914 transitions. [2019-11-15 20:22:56,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:22:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 15734 states and 45914 transitions. [2019-11-15 20:22:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:22:56,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:56,246 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:56,247 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:56,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:56,247 INFO L82 PathProgramCache]: Analyzing trace with hash -893789607, now seen corresponding path program 1 times [2019-11-15 20:22:56,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:56,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509352774] [2019-11-15 20:22:56,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:56,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:56,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:56,359 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-15 20:22:56,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509352774] [2019-11-15 20:22:56,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:56,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:22:56,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436621929] [2019-11-15 20:22:56,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:22:56,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:22:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:22:56,361 INFO L87 Difference]: Start difference. First operand 15734 states and 45914 transitions. Second operand 6 states. [2019-11-15 20:22:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:56,968 INFO L93 Difference]: Finished difference Result 18009 states and 51105 transitions. [2019-11-15 20:22:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:22:56,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:22:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:57,003 INFO L225 Difference]: With dead ends: 18009 [2019-11-15 20:22:57,003 INFO L226 Difference]: Without dead ends: 18009 [2019-11-15 20:22:57,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:22:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18009 states. [2019-11-15 20:22:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18009 to 16463. [2019-11-15 20:22:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16463 states. [2019-11-15 20:22:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16463 states to 16463 states and 47196 transitions. [2019-11-15 20:22:57,279 INFO L78 Accepts]: Start accepts. Automaton has 16463 states and 47196 transitions. Word has length 66 [2019-11-15 20:22:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:57,279 INFO L462 AbstractCegarLoop]: Abstraction has 16463 states and 47196 transitions. [2019-11-15 20:22:57,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:22:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 16463 states and 47196 transitions. [2019-11-15 20:22:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:22:57,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:57,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:57,293 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash -682438694, now seen corresponding path program 1 times [2019-11-15 20:22:57,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:57,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238874863] [2019-11-15 20:22:57,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:57,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:57,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:57,389 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-15 20:22:57,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238874863] [2019-11-15 20:22:57,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:57,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:57,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742279752] [2019-11-15 20:22:57,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:57,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:57,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:57,392 INFO L87 Difference]: Start difference. First operand 16463 states and 47196 transitions. Second operand 5 states. [2019-11-15 20:22:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:57,881 INFO L93 Difference]: Finished difference Result 21377 states and 61186 transitions. [2019-11-15 20:22:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:22:57,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:22:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:57,916 INFO L225 Difference]: With dead ends: 21377 [2019-11-15 20:22:57,916 INFO L226 Difference]: Without dead ends: 21377 [2019-11-15 20:22:57,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:22:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21377 states. [2019-11-15 20:22:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21377 to 19442. [2019-11-15 20:22:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19442 states. [2019-11-15 20:22:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19442 states to 19442 states and 55401 transitions. [2019-11-15 20:22:58,670 INFO L78 Accepts]: Start accepts. Automaton has 19442 states and 55401 transitions. Word has length 66 [2019-11-15 20:22:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:58,670 INFO L462 AbstractCegarLoop]: Abstraction has 19442 states and 55401 transitions. [2019-11-15 20:22:58,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 19442 states and 55401 transitions. [2019-11-15 20:22:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:22:58,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:58,682 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:58,683 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1192972871, now seen corresponding path program 1 times [2019-11-15 20:22:58,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:58,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511620775] [2019-11-15 20:22:58,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:58,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:58,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:58,760 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-15 20:22:58,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511620775] [2019-11-15 20:22:58,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:58,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:58,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233873558] [2019-11-15 20:22:58,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:58,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:58,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:58,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:58,768 INFO L87 Difference]: Start difference. First operand 19442 states and 55401 transitions. Second operand 5 states. [2019-11-15 20:22:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:59,354 INFO L93 Difference]: Finished difference Result 25955 states and 73603 transitions. [2019-11-15 20:22:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:22:59,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:22:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:59,393 INFO L225 Difference]: With dead ends: 25955 [2019-11-15 20:22:59,393 INFO L226 Difference]: Without dead ends: 25955 [2019-11-15 20:22:59,394 INFO L600 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-15 20:22:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25955 states. [2019-11-15 20:22:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25955 to 21135. [2019-11-15 20:22:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21135 states. [2019-11-15 20:22:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21135 states to 21135 states and 60029 transitions. [2019-11-15 20:22:59,719 INFO L78 Accepts]: Start accepts. Automaton has 21135 states and 60029 transitions. Word has length 66 [2019-11-15 20:22:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:59,719 INFO L462 AbstractCegarLoop]: Abstraction has 21135 states and 60029 transitions. [2019-11-15 20:22:59,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 21135 states and 60029 transitions. [2019-11-15 20:22:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:22:59,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:22:59,728 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:22:59,729 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:22:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:22:59,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1294539962, now seen corresponding path program 1 times [2019-11-15 20:22:59,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:22:59,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591841667] [2019-11-15 20:22:59,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:59,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:22:59,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:22:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:22:59,816 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-15 20:22:59,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591841667] [2019-11-15 20:22:59,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:22:59,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:22:59,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105569868] [2019-11-15 20:22:59,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:22:59,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:22:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:22:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:22:59,819 INFO L87 Difference]: Start difference. First operand 21135 states and 60029 transitions. Second operand 5 states. [2019-11-15 20:22:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:22:59,898 INFO L93 Difference]: Finished difference Result 7140 states and 16460 transitions. [2019-11-15 20:22:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:22:59,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:22:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:22:59,907 INFO L225 Difference]: With dead ends: 7140 [2019-11-15 20:22:59,907 INFO L226 Difference]: Without dead ends: 5970 [2019-11-15 20:22:59,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:22:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2019-11-15 20:22:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 5060. [2019-11-15 20:22:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2019-11-15 20:22:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 11349 transitions. [2019-11-15 20:22:59,994 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 11349 transitions. Word has length 66 [2019-11-15 20:22:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:22:59,994 INFO L462 AbstractCegarLoop]: Abstraction has 5060 states and 11349 transitions. [2019-11-15 20:22:59,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:22:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 11349 transitions. [2019-11-15 20:23:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:23:00,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:00,001 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:00,001 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1221361139, now seen corresponding path program 1 times [2019-11-15 20:23:00,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:00,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502988047] [2019-11-15 20:23:00,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:00,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:00,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:00,098 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-15 20:23:00,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502988047] [2019-11-15 20:23:00,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:00,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:23:00,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643456213] [2019-11-15 20:23:00,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:23:00,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:23:00,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:23:00,104 INFO L87 Difference]: Start difference. First operand 5060 states and 11349 transitions. Second operand 5 states. [2019-11-15 20:23:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:00,365 INFO L93 Difference]: Finished difference Result 6137 states and 13814 transitions. [2019-11-15 20:23:00,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:23:00,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 20:23:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:00,374 INFO L225 Difference]: With dead ends: 6137 [2019-11-15 20:23:00,374 INFO L226 Difference]: Without dead ends: 6137 [2019-11-15 20:23:00,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:23:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2019-11-15 20:23:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 5480. [2019-11-15 20:23:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2019-11-15 20:23:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 12307 transitions. [2019-11-15 20:23:00,449 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 12307 transitions. Word has length 72 [2019-11-15 20:23:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:00,450 INFO L462 AbstractCegarLoop]: Abstraction has 5480 states and 12307 transitions. [2019-11-15 20:23:00,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:23:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 12307 transitions. [2019-11-15 20:23:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:23:00,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:00,454 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:00,455 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash 521449196, now seen corresponding path program 1 times [2019-11-15 20:23:00,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:00,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081131393] [2019-11-15 20:23:00,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:00,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:00,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:00,530 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-15 20:23:00,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081131393] [2019-11-15 20:23:00,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:00,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:00,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845665988] [2019-11-15 20:23:00,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:00,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:00,532 INFO L87 Difference]: Start difference. First operand 5480 states and 12307 transitions. Second operand 7 states. [2019-11-15 20:23:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:01,073 INFO L93 Difference]: Finished difference Result 6311 states and 14033 transitions. [2019-11-15 20:23:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:23:01,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 20:23:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:01,079 INFO L225 Difference]: With dead ends: 6311 [2019-11-15 20:23:01,080 INFO L226 Difference]: Without dead ends: 6258 [2019-11-15 20:23:01,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:23:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6258 states. [2019-11-15 20:23:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6258 to 5567. [2019-11-15 20:23:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2019-11-15 20:23:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 12396 transitions. [2019-11-15 20:23:01,142 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 12396 transitions. Word has length 72 [2019-11-15 20:23:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:01,143 INFO L462 AbstractCegarLoop]: Abstraction has 5567 states and 12396 transitions. [2019-11-15 20:23:01,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 12396 transitions. [2019-11-15 20:23:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:23:01,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:01,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:01,148 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1915673888, now seen corresponding path program 1 times [2019-11-15 20:23:01,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:01,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371602020] [2019-11-15 20:23:01,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:01,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:01,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:01,313 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-15 20:23:01,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371602020] [2019-11-15 20:23:01,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:01,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:01,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94126255] [2019-11-15 20:23:01,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:01,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:01,316 INFO L87 Difference]: Start difference. First operand 5567 states and 12396 transitions. Second operand 7 states. [2019-11-15 20:23:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:01,934 INFO L93 Difference]: Finished difference Result 6725 states and 14960 transitions. [2019-11-15 20:23:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:23:01,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-15 20:23:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:01,943 INFO L225 Difference]: With dead ends: 6725 [2019-11-15 20:23:01,944 INFO L226 Difference]: Without dead ends: 6725 [2019-11-15 20:23:01,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2019-11-15 20:23:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6043. [2019-11-15 20:23:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6043 states. [2019-11-15 20:23:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6043 states to 6043 states and 13423 transitions. [2019-11-15 20:23:02,040 INFO L78 Accepts]: Start accepts. Automaton has 6043 states and 13423 transitions. Word has length 91 [2019-11-15 20:23:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:02,040 INFO L462 AbstractCegarLoop]: Abstraction has 6043 states and 13423 transitions. [2019-11-15 20:23:02,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 6043 states and 13423 transitions. [2019-11-15 20:23:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:23:02,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:02,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:02,046 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash -232596078, now seen corresponding path program 1 times [2019-11-15 20:23:02,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:02,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380396442] [2019-11-15 20:23:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:02,225 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-15 20:23:02,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380396442] [2019-11-15 20:23:02,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:02,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:02,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161512139] [2019-11-15 20:23:02,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:02,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:02,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:02,233 INFO L87 Difference]: Start difference. First operand 6043 states and 13423 transitions. Second operand 7 states. [2019-11-15 20:23:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:03,029 INFO L93 Difference]: Finished difference Result 6849 states and 15138 transitions. [2019-11-15 20:23:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:23:03,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-15 20:23:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:03,036 INFO L225 Difference]: With dead ends: 6849 [2019-11-15 20:23:03,036 INFO L226 Difference]: Without dead ends: 6709 [2019-11-15 20:23:03,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:23:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-11-15 20:23:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 6267. [2019-11-15 20:23:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2019-11-15 20:23:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 13923 transitions. [2019-11-15 20:23:03,113 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 13923 transitions. Word has length 91 [2019-11-15 20:23:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:03,114 INFO L462 AbstractCegarLoop]: Abstraction has 6267 states and 13923 transitions. [2019-11-15 20:23:03,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 13923 transitions. [2019-11-15 20:23:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:23:03,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:03,120 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:03,120 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash 603871188, now seen corresponding path program 2 times [2019-11-15 20:23:03,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:03,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464605457] [2019-11-15 20:23:03,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:03,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:03,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:23:03,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464605457] [2019-11-15 20:23:03,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:03,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:03,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002417220] [2019-11-15 20:23:03,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:03,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:03,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:03,258 INFO L87 Difference]: Start difference. First operand 6267 states and 13923 transitions. Second operand 7 states. [2019-11-15 20:23:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:03,874 INFO L93 Difference]: Finished difference Result 7995 states and 17515 transitions. [2019-11-15 20:23:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:23:03,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-15 20:23:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:03,882 INFO L225 Difference]: With dead ends: 7995 [2019-11-15 20:23:03,882 INFO L226 Difference]: Without dead ends: 7943 [2019-11-15 20:23:03,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:23:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2019-11-15 20:23:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 7065. [2019-11-15 20:23:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7065 states. [2019-11-15 20:23:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 15564 transitions. [2019-11-15 20:23:03,965 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 15564 transitions. Word has length 91 [2019-11-15 20:23:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:03,966 INFO L462 AbstractCegarLoop]: Abstraction has 7065 states and 15564 transitions. [2019-11-15 20:23:03,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 15564 transitions. [2019-11-15 20:23:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:23:03,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:03,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:03,975 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1564873951, now seen corresponding path program 1 times [2019-11-15 20:23:03,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:03,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349044204] [2019-11-15 20:23:03,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:03,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:03,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:04,042 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-15 20:23:04,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349044204] [2019-11-15 20:23:04,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:04,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:23:04,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946127540] [2019-11-15 20:23:04,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:23:04,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:04,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:23:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:04,044 INFO L87 Difference]: Start difference. First operand 7065 states and 15564 transitions. Second operand 4 states. [2019-11-15 20:23:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:04,202 INFO L93 Difference]: Finished difference Result 7438 states and 16287 transitions. [2019-11-15 20:23:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:23:04,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 20:23:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:04,212 INFO L225 Difference]: With dead ends: 7438 [2019-11-15 20:23:04,213 INFO L226 Difference]: Without dead ends: 7193 [2019-11-15 20:23:04,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:23:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7193 states. [2019-11-15 20:23:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7193 to 6610. [2019-11-15 20:23:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6610 states. [2019-11-15 20:23:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 14582 transitions. [2019-11-15 20:23:04,320 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 14582 transitions. Word has length 91 [2019-11-15 20:23:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:04,320 INFO L462 AbstractCegarLoop]: Abstraction has 6610 states and 14582 transitions. [2019-11-15 20:23:04,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:23:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 14582 transitions. [2019-11-15 20:23:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:23:04,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:04,331 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:04,331 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:04,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash 594827610, now seen corresponding path program 1 times [2019-11-15 20:23:04,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:04,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422373720] [2019-11-15 20:23:04,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:04,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:04,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:04,433 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-15 20:23:04,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422373720] [2019-11-15 20:23:04,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:04,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:23:04,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357638986] [2019-11-15 20:23:04,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:23:04,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:23:04,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:23:04,436 INFO L87 Difference]: Start difference. First operand 6610 states and 14582 transitions. Second operand 5 states. [2019-11-15 20:23:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:04,762 INFO L93 Difference]: Finished difference Result 7690 states and 16895 transitions. [2019-11-15 20:23:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:23:04,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 20:23:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:04,770 INFO L225 Difference]: With dead ends: 7690 [2019-11-15 20:23:04,770 INFO L226 Difference]: Without dead ends: 7665 [2019-11-15 20:23:04,770 INFO L600 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-15 20:23:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2019-11-15 20:23:04,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 6352. [2019-11-15 20:23:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-11-15 20:23:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 14075 transitions. [2019-11-15 20:23:04,847 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 14075 transitions. Word has length 93 [2019-11-15 20:23:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:04,847 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 14075 transitions. [2019-11-15 20:23:04,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:23:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 14075 transitions. [2019-11-15 20:23:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:23:04,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:04,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:04,853 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:04,854 INFO L82 PathProgramCache]: Analyzing trace with hash 865163306, now seen corresponding path program 2 times [2019-11-15 20:23:04,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:04,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893573468] [2019-11-15 20:23:04,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:04,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:04,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:04,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-15 20:23:04,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893573468] [2019-11-15 20:23:04,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:04,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:23:04,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788394527] [2019-11-15 20:23:04,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:23:04,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:23:04,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:23:04,970 INFO L87 Difference]: Start difference. First operand 6352 states and 14075 transitions. Second operand 6 states. [2019-11-15 20:23:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:05,320 INFO L93 Difference]: Finished difference Result 7784 states and 17218 transitions. [2019-11-15 20:23:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:23:05,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:23:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:05,327 INFO L225 Difference]: With dead ends: 7784 [2019-11-15 20:23:05,327 INFO L226 Difference]: Without dead ends: 7766 [2019-11-15 20:23:05,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-11-15 20:23:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 6778. [2019-11-15 20:23:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6778 states. [2019-11-15 20:23:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6778 states to 6778 states and 15065 transitions. [2019-11-15 20:23:05,409 INFO L78 Accepts]: Start accepts. Automaton has 6778 states and 15065 transitions. Word has length 93 [2019-11-15 20:23:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:05,410 INFO L462 AbstractCegarLoop]: Abstraction has 6778 states and 15065 transitions. [2019-11-15 20:23:05,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:23:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6778 states and 15065 transitions. [2019-11-15 20:23:05,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:23:05,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:05,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:05,420 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -931788053, now seen corresponding path program 1 times [2019-11-15 20:23:05,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:05,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107983589] [2019-11-15 20:23:05,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:05,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:05,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:05,601 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-15 20:23:05,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107983589] [2019-11-15 20:23:05,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:05,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:23:05,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841289688] [2019-11-15 20:23:05,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:23:05,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:23:05,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:23:05,605 INFO L87 Difference]: Start difference. First operand 6778 states and 15065 transitions. Second operand 6 states. [2019-11-15 20:23:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:05,714 INFO L93 Difference]: Finished difference Result 8043 states and 17763 transitions. [2019-11-15 20:23:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:23:05,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-15 20:23:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:05,721 INFO L225 Difference]: With dead ends: 8043 [2019-11-15 20:23:05,722 INFO L226 Difference]: Without dead ends: 8043 [2019-11-15 20:23:05,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:23:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8043 states. [2019-11-15 20:23:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8043 to 6902. [2019-11-15 20:23:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6902 states. [2019-11-15 20:23:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 15262 transitions. [2019-11-15 20:23:05,803 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 15262 transitions. Word has length 93 [2019-11-15 20:23:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:05,803 INFO L462 AbstractCegarLoop]: Abstraction has 6902 states and 15262 transitions. [2019-11-15 20:23:05,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:23:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 15262 transitions. [2019-11-15 20:23:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:23:05,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:05,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:05,812 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1776259924, now seen corresponding path program 1 times [2019-11-15 20:23:05,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:05,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066892259] [2019-11-15 20:23:05,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:05,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:05,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:05,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-15 20:23:05,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066892259] [2019-11-15 20:23:05,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:05,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:05,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966933274] [2019-11-15 20:23:05,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:05,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:05,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:05,970 INFO L87 Difference]: Start difference. First operand 6902 states and 15262 transitions. Second operand 7 states. [2019-11-15 20:23:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:06,197 INFO L93 Difference]: Finished difference Result 8416 states and 18709 transitions. [2019-11-15 20:23:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:23:06,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 20:23:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:06,207 INFO L225 Difference]: With dead ends: 8416 [2019-11-15 20:23:06,208 INFO L226 Difference]: Without dead ends: 8416 [2019-11-15 20:23:06,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-11-15 20:23:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 6128. [2019-11-15 20:23:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2019-11-15 20:23:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 13491 transitions. [2019-11-15 20:23:06,295 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 13491 transitions. Word has length 93 [2019-11-15 20:23:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:06,295 INFO L462 AbstractCegarLoop]: Abstraction has 6128 states and 13491 transitions. [2019-11-15 20:23:06,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 13491 transitions. [2019-11-15 20:23:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:23:06,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:06,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:06,300 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:06,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:06,301 INFO L82 PathProgramCache]: Analyzing trace with hash 441498029, now seen corresponding path program 1 times [2019-11-15 20:23:06,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:06,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67581512] [2019-11-15 20:23:06,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:06,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:06,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:06,370 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-15 20:23:06,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67581512] [2019-11-15 20:23:06,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:06,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:23:06,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944698694] [2019-11-15 20:23:06,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:23:06,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:23:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:23:06,373 INFO L87 Difference]: Start difference. First operand 6128 states and 13491 transitions. Second operand 3 states. [2019-11-15 20:23:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:06,411 INFO L93 Difference]: Finished difference Result 6092 states and 13344 transitions. [2019-11-15 20:23:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:23:06,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-15 20:23:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:06,418 INFO L225 Difference]: With dead ends: 6092 [2019-11-15 20:23:06,418 INFO L226 Difference]: Without dead ends: 6074 [2019-11-15 20:23:06,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:23:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2019-11-15 20:23:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 5190. [2019-11-15 20:23:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2019-11-15 20:23:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 11371 transitions. [2019-11-15 20:23:06,476 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 11371 transitions. Word has length 93 [2019-11-15 20:23:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:06,476 INFO L462 AbstractCegarLoop]: Abstraction has 5190 states and 11371 transitions. [2019-11-15 20:23:06,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:23:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 11371 transitions. [2019-11-15 20:23:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:06,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:06,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:06,481 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -365650912, now seen corresponding path program 1 times [2019-11-15 20:23:06,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:06,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678770271] [2019-11-15 20:23:06,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:06,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:06,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:06,636 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-15 20:23:06,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678770271] [2019-11-15 20:23:06,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:06,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:06,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431220063] [2019-11-15 20:23:06,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:06,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:06,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:06,638 INFO L87 Difference]: Start difference. First operand 5190 states and 11371 transitions. Second operand 7 states. [2019-11-15 20:23:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:07,054 INFO L93 Difference]: Finished difference Result 6230 states and 13529 transitions. [2019-11-15 20:23:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:23:07,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 20:23:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:07,062 INFO L225 Difference]: With dead ends: 6230 [2019-11-15 20:23:07,062 INFO L226 Difference]: Without dead ends: 6230 [2019-11-15 20:23:07,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:23:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-11-15 20:23:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 5161. [2019-11-15 20:23:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-11-15 20:23:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11322 transitions. [2019-11-15 20:23:07,149 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11322 transitions. Word has length 95 [2019-11-15 20:23:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:07,149 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11322 transitions. [2019-11-15 20:23:07,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11322 transitions. [2019-11-15 20:23:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:07,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:07,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:07,157 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:07,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1493137985, now seen corresponding path program 1 times [2019-11-15 20:23:07,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:07,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635004454] [2019-11-15 20:23:07,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:07,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:07,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:07,252 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-15 20:23:07,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635004454] [2019-11-15 20:23:07,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:07,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:23:07,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975308519] [2019-11-15 20:23:07,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:23:07,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:07,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:23:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:23:07,255 INFO L87 Difference]: Start difference. First operand 5161 states and 11322 transitions. Second operand 6 states. [2019-11-15 20:23:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:07,787 INFO L93 Difference]: Finished difference Result 6385 states and 13887 transitions. [2019-11-15 20:23:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:23:07,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:23:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:07,796 INFO L225 Difference]: With dead ends: 6385 [2019-11-15 20:23:07,796 INFO L226 Difference]: Without dead ends: 6385 [2019-11-15 20:23:07,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:23:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6385 states. [2019-11-15 20:23:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6385 to 5137. [2019-11-15 20:23:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5137 states. [2019-11-15 20:23:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5137 states to 5137 states and 11270 transitions. [2019-11-15 20:23:07,881 INFO L78 Accepts]: Start accepts. Automaton has 5137 states and 11270 transitions. Word has length 95 [2019-11-15 20:23:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:07,881 INFO L462 AbstractCegarLoop]: Abstraction has 5137 states and 11270 transitions. [2019-11-15 20:23:07,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:23:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 5137 states and 11270 transitions. [2019-11-15 20:23:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:07,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:07,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:07,889 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:07,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 982603808, now seen corresponding path program 1 times [2019-11-15 20:23:07,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:07,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213174471] [2019-11-15 20:23:07,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:07,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:07,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:07,967 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-15 20:23:07,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213174471] [2019-11-15 20:23:07,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:07,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:23:07,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727800256] [2019-11-15 20:23:07,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:23:07,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:23:07,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:07,970 INFO L87 Difference]: Start difference. First operand 5137 states and 11270 transitions. Second operand 4 states. [2019-11-15 20:23:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:08,169 INFO L93 Difference]: Finished difference Result 5218 states and 11459 transitions. [2019-11-15 20:23:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:23:08,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:23:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:08,176 INFO L225 Difference]: With dead ends: 5218 [2019-11-15 20:23:08,177 INFO L226 Difference]: Without dead ends: 5200 [2019-11-15 20:23:08,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:23:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2019-11-15 20:23:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 4901. [2019-11-15 20:23:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4901 states. [2019-11-15 20:23:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 10759 transitions. [2019-11-15 20:23:08,251 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 10759 transitions. Word has length 95 [2019-11-15 20:23:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:08,251 INFO L462 AbstractCegarLoop]: Abstraction has 4901 states and 10759 transitions. [2019-11-15 20:23:08,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:23:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 10759 transitions. [2019-11-15 20:23:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:08,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:08,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:08,258 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash -814347551, now seen corresponding path program 1 times [2019-11-15 20:23:08,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:08,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046786418] [2019-11-15 20:23:08,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:08,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:08,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:08,459 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-15 20:23:08,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046786418] [2019-11-15 20:23:08,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:08,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:23:08,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919523556] [2019-11-15 20:23:08,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:23:08,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:08,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:23:08,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:23:08,466 INFO L87 Difference]: Start difference. First operand 4901 states and 10759 transitions. Second operand 9 states. [2019-11-15 20:23:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:09,221 INFO L93 Difference]: Finished difference Result 19777 states and 43902 transitions. [2019-11-15 20:23:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:23:09,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 20:23:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:09,236 INFO L225 Difference]: With dead ends: 19777 [2019-11-15 20:23:09,237 INFO L226 Difference]: Without dead ends: 11497 [2019-11-15 20:23:09,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:23:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11497 states. [2019-11-15 20:23:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11497 to 4689. [2019-11-15 20:23:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4689 states. [2019-11-15 20:23:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 10192 transitions. [2019-11-15 20:23:09,356 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 10192 transitions. Word has length 95 [2019-11-15 20:23:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:09,356 INFO L462 AbstractCegarLoop]: Abstraction has 4689 states and 10192 transitions. [2019-11-15 20:23:09,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:23:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 10192 transitions. [2019-11-15 20:23:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:09,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:09,363 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:09,363 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -909093823, now seen corresponding path program 2 times [2019-11-15 20:23:09,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:09,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24011968] [2019-11-15 20:23:09,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:09,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:09,545 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-15 20:23:09,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24011968] [2019-11-15 20:23:09,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:09,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:23:09,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477446600] [2019-11-15 20:23:09,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:23:09,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:09,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:23:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:23:09,548 INFO L87 Difference]: Start difference. First operand 4689 states and 10192 transitions. Second operand 7 states. [2019-11-15 20:23:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:09,676 INFO L93 Difference]: Finished difference Result 7965 states and 17460 transitions. [2019-11-15 20:23:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:23:09,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 20:23:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:09,681 INFO L225 Difference]: With dead ends: 7965 [2019-11-15 20:23:09,681 INFO L226 Difference]: Without dead ends: 3464 [2019-11-15 20:23:09,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2019-11-15 20:23:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3464. [2019-11-15 20:23:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-11-15 20:23:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 7622 transitions. [2019-11-15 20:23:09,733 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 7622 transitions. Word has length 95 [2019-11-15 20:23:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:09,733 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 7622 transitions. [2019-11-15 20:23:09,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:23:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 7622 transitions. [2019-11-15 20:23:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:09,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:09,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:09,739 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1276778385, now seen corresponding path program 1 times [2019-11-15 20:23:09,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:09,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387916076] [2019-11-15 20:23:09,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:09,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:09,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:09,833 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-15 20:23:09,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387916076] [2019-11-15 20:23:09,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:09,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:23:09,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268807171] [2019-11-15 20:23:09,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:23:09,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:23:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:23:09,836 INFO L87 Difference]: Start difference. First operand 3464 states and 7622 transitions. Second operand 6 states. [2019-11-15 20:23:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:10,261 INFO L93 Difference]: Finished difference Result 4165 states and 9079 transitions. [2019-11-15 20:23:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:23:10,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:23:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:10,267 INFO L225 Difference]: With dead ends: 4165 [2019-11-15 20:23:10,268 INFO L226 Difference]: Without dead ends: 4165 [2019-11-15 20:23:10,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2019-11-15 20:23:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 3451. [2019-11-15 20:23:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-11-15 20:23:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 7584 transitions. [2019-11-15 20:23:10,327 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 7584 transitions. Word has length 95 [2019-11-15 20:23:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:10,327 INFO L462 AbstractCegarLoop]: Abstraction has 3451 states and 7584 transitions. [2019-11-15 20:23:10,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:23:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 7584 transitions. [2019-11-15 20:23:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:10,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:10,332 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:10,332 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1773424430, now seen corresponding path program 2 times [2019-11-15 20:23:10,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:10,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40747400] [2019-11-15 20:23:10,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:10,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:10,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:10,462 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-15 20:23:10,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40747400] [2019-11-15 20:23:10,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:10,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:23:10,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57370597] [2019-11-15 20:23:10,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:23:10,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:10,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:23:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:23:10,464 INFO L87 Difference]: Start difference. First operand 3451 states and 7584 transitions. Second operand 8 states. [2019-11-15 20:23:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:10,896 INFO L93 Difference]: Finished difference Result 4150 states and 8986 transitions. [2019-11-15 20:23:10,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:23:10,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 20:23:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:10,900 INFO L225 Difference]: With dead ends: 4150 [2019-11-15 20:23:10,900 INFO L226 Difference]: Without dead ends: 4150 [2019-11-15 20:23:10,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2019-11-15 20:23:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 3464. [2019-11-15 20:23:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-11-15 20:23:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 7611 transitions. [2019-11-15 20:23:10,938 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 7611 transitions. Word has length 95 [2019-11-15 20:23:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:10,938 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 7611 transitions. [2019-11-15 20:23:10,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:23:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 7611 transitions. [2019-11-15 20:23:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:10,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:10,943 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:10,943 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash 85364467, now seen corresponding path program 2 times [2019-11-15 20:23:10,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:10,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174588305] [2019-11-15 20:23:10,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:10,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:10,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:11,042 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-15 20:23:11,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174588305] [2019-11-15 20:23:11,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:11,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:23:11,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275860335] [2019-11-15 20:23:11,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:23:11,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:23:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:23:11,045 INFO L87 Difference]: Start difference. First operand 3464 states and 7611 transitions. Second operand 6 states. [2019-11-15 20:23:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:11,415 INFO L93 Difference]: Finished difference Result 3821 states and 8384 transitions. [2019-11-15 20:23:11,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:23:11,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 20:23:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:11,421 INFO L225 Difference]: With dead ends: 3821 [2019-11-15 20:23:11,421 INFO L226 Difference]: Without dead ends: 3821 [2019-11-15 20:23:11,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-11-15 20:23:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3433. [2019-11-15 20:23:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2019-11-15 20:23:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 7547 transitions. [2019-11-15 20:23:11,476 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 7547 transitions. Word has length 95 [2019-11-15 20:23:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:11,476 INFO L462 AbstractCegarLoop]: Abstraction has 3433 states and 7547 transitions. [2019-11-15 20:23:11,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:23:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 7547 transitions. [2019-11-15 20:23:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:11,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:11,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:11,482 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2072846227, now seen corresponding path program 3 times [2019-11-15 20:23:11,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:11,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829552215] [2019-11-15 20:23:11,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:11,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:11,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:11,693 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-15 20:23:11,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829552215] [2019-11-15 20:23:11,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:11,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:23:11,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144504750] [2019-11-15 20:23:11,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:23:11,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:23:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:23:11,698 INFO L87 Difference]: Start difference. First operand 3433 states and 7547 transitions. Second operand 10 states. [2019-11-15 20:23:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:12,217 INFO L93 Difference]: Finished difference Result 6773 states and 15097 transitions. [2019-11-15 20:23:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:23:12,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:23:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:12,223 INFO L225 Difference]: With dead ends: 6773 [2019-11-15 20:23:12,223 INFO L226 Difference]: Without dead ends: 4405 [2019-11-15 20:23:12,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:23:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2019-11-15 20:23:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 3403. [2019-11-15 20:23:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-11-15 20:23:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 7481 transitions. [2019-11-15 20:23:12,280 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 7481 transitions. Word has length 95 [2019-11-15 20:23:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:12,281 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 7481 transitions. [2019-11-15 20:23:12,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:23:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 7481 transitions. [2019-11-15 20:23:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:23:12,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:12,286 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:23:12,286 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 266977457, now seen corresponding path program 4 times [2019-11-15 20:23:12,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:12,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397974303] [2019-11-15 20:23:12,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:12,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:12,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:23:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:23:12,401 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:23:12,402 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:23:12,614 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:23:12,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:23:12 BasicIcfg [2019-11-15 20:23:12,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:23:12,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:23:12,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:23:12,617 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:23:12,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:22:28" (3/4) ... [2019-11-15 20:23:12,620 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:23:12,763 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_525c6b5e-6fdb-4d71-a6e3-be29f50ab313/bin/uautomizer/witness.graphml [2019-11-15 20:23:12,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:23:12,766 INFO L168 Benchmark]: Toolchain (without parser) took 45580.25 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 939.4 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 20:23:12,766 INFO L168 Benchmark]: CDTParser took 0.24 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-15 20:23:12,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:23:12,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:23:12,768 INFO L168 Benchmark]: Boogie Preprocessor took 36.08 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-15 20:23:12,768 INFO L168 Benchmark]: RCFGBuilder took 774.20 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:23:12,769 INFO L168 Benchmark]: TraceAbstraction took 43811.32 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 20:23:12,769 INFO L168 Benchmark]: Witness Printer took 147.19 ms. Allocated memory is still 4.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:23:12,772 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.24 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 727.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.08 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 774.20 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43811.32 ms. Allocated memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 147.19 ms. Allocated memory is still 4.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 0 pthread_t t1711; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK 0 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L798] 0 pthread_t t1712; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L730] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L731] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L732] 1 x$r_buff0_thd1 = (_Bool)1 [L735] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L763] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x = x$flush_delayed ? x$mem_tmp : x [L771] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L806] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 43.6s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9832 SDtfs, 10185 SDslu, 24812 SDs, 0 SdLazy, 8582 SolverSat, 513 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 112 SyntacticMatches, 27 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60245occurred 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: 14.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 79298 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2895 NumberOfCodeBlocks, 2895 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2763 ConstructedInterpolants, 0 QuantifiedInterpolants, 599097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...