./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_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_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/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 d8d2fbb7e8f32489f0aa9220db00cd28db1defb7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 19:56:33,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:56:33,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:56:33,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:56:33,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:56:33,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:56:33,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:56:33,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:56:33,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:56:33,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:56:33,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:56:33,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:56:33,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:56:33,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:56:33,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:56:33,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:56:33,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:56:33,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:56:33,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:56:33,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:56:33,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:56:33,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:56:33,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:56:33,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:56:33,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:56:33,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:56:33,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:56:33,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:56:33,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:56:33,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:56:33,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:56:33,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:56:33,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:56:33,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:56:33,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:56:33,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:56:33,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:56:33,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:56:33,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:56:33,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:56:33,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:56:33,919 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 19:56:33,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:56:33,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:56:33,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:56:33,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:56:33,933 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:56:33,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:56:33,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:56:33,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:56:33,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:56:33,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:56:33,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 19:56:33,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:56:33,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 19:56:33,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:56:33,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:56:33,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:56:33,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 19:56:33,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:56:33,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:56:33,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:56:33,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:56:33,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:56:33,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:56:33,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:56:33,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 19:56:33,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:56:33,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:56:33,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 19:56:33,938 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_45f587f1-a8a4-4752-95e1-c5a96a661606/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 -> d8d2fbb7e8f32489f0aa9220db00cd28db1defb7 [2019-11-15 19:56:33,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:56:33,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:56:33,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:56:33,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:56:33,976 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:56:33,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i [2019-11-15 19:56:34,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/data/5f0899817/446759f51f6a43f68b79532c8a8ebaad/FLAGd13df389c [2019-11-15 19:56:34,528 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:56:34,529 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i [2019-11-15 19:56:34,542 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/data/5f0899817/446759f51f6a43f68b79532c8a8ebaad/FLAGd13df389c [2019-11-15 19:56:34,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/data/5f0899817/446759f51f6a43f68b79532c8a8ebaad [2019-11-15 19:56:34,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:56:34,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:56:34,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:56:34,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:56:34,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:56:34,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:56:34" (1/1) ... [2019-11-15 19:56:34,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e2cc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:34, skipping insertion in model container [2019-11-15 19:56:34,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:56:34" (1/1) ... [2019-11-15 19:56:34,869 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:56:34,916 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:56:35,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:56:35,303 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:56:35,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:56:35,468 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:56:35,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35 WrapperNode [2019-11-15 19:56:35,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:56:35,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:56:35,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:56:35,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:56:35,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:56:35,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:56:35,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:56:35,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:56:35,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... [2019-11-15 19:56:35,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:56:35,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:56:35,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:56:35,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:56:35,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/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 19:56:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:56:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 19:56:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:56:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:56:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 19:56:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 19:56:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 19:56:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 19:56:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 19:56:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:56:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:56:35,656 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 19:56:36,336 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:56:36,338 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 19:56:36,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:36 BoogieIcfgContainer [2019-11-15 19:56:36,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:56:36,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:56:36,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:56:36,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:56:36,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:56:34" (1/3) ... [2019-11-15 19:56:36,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470ea393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:56:36, skipping insertion in model container [2019-11-15 19:56:36,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:56:35" (2/3) ... [2019-11-15 19:56:36,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470ea393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:56:36, skipping insertion in model container [2019-11-15 19:56:36,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:36" (3/3) ... [2019-11-15 19:56:36,348 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_pso.opt.i [2019-11-15 19:56:36,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,386 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,387 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,387 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,387 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,387 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,388 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,390 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,390 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,390 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,390 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,391 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,391 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,391 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,391 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,392 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,392 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,392 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,392 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,398 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,399 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,400 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,402 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,402 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,408 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,413 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,414 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,415 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,431 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,432 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,432 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,432 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,432 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,432 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,432 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,433 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,433 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,433 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,433 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,433 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 19:56:36,450 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 19:56:36,450 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:56:36,461 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 19:56:36,468 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 19:56:36,484 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:56:36,484 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 19:56:36,484 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:56:36,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:56:36,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:56:36,485 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:56:36,485 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:56:36,485 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:56:36,497 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 19:56:39,307 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 19:56:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 19:56:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 19:56:39,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:39,319 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 19:56:39,321 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-15 19:56:39,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:39,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145613270] [2019-11-15 19:56:39,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:39,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:39,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,579 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 19:56:39,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145613270] [2019-11-15 19:56:39,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:39,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:56:39,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13896743] [2019-11-15 19:56:39,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:56:39,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:56:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:56:39,604 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 19:56:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:40,418 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 19:56:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:56:40,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 19:56:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:40,683 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 19:56:40,683 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 19:56:40,685 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 19:56:41,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 19:56:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 19:56:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 19:56:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 19:56:42,257 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 19:56:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:42,258 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 19:56:42,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:56:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 19:56:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 19:56:42,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:42,268 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 19:56:42,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-15 19:56:42,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:42,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103435209] [2019-11-15 19:56:42,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:42,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:42,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:42,408 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 19:56:42,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103435209] [2019-11-15 19:56:42,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:42,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:56:42,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706997299] [2019-11-15 19:56:42,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:56:42,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:56:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:56:42,412 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 19:56:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:43,293 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 19:56:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:56:43,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 19:56:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:43,492 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 19:56:43,492 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 19:56:43,493 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 19:56:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 19:56:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 19:56:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 19:56:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 19:56:44,918 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 19:56:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:44,920 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 19:56:44,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:56:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 19:56:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 19:56:44,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:44,930 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 19:56:44,931 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-15 19:56:44,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:44,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113206483] [2019-11-15 19:56:44,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:44,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:44,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:45,015 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 19:56:45,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113206483] [2019-11-15 19:56:45,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:45,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:56:45,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217923575] [2019-11-15 19:56:45,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:56:45,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:56:45,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:56:45,017 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 19:56:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:45,626 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 19:56:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:56:45,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 19:56:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:45,842 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 19:56:45,843 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 19:56:45,843 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 19:56:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 19:56:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 19:56:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 19:56:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 19:56:47,613 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 19:56:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:47,613 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 19:56:47,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:56:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 19:56:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 19:56:47,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:47,621 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 19:56:47,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-15 19:56:47,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:47,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718309471] [2019-11-15 19:56:47,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:47,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:47,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:47,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 19:56:47,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718309471] [2019-11-15 19:56:47,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:47,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:56:47,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807706948] [2019-11-15 19:56:47,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:56:47,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:47,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:56:47,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:56:47,695 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 19:56:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:48,023 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 19:56:48,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:56:48,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 19:56:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:48,202 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 19:56:48,203 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 19:56:48,203 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 19:56:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 19:56:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 19:56:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 19:56:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 19:56:50,035 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 19:56:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:50,036 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 19:56:50,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:56:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 19:56:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:56:50,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:50,054 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 19:56:50,055 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:50,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:50,055 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-15 19:56:50,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:50,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539472218] [2019-11-15 19:56:50,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:50,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:50,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:50,181 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 19:56:50,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539472218] [2019-11-15 19:56:50,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:50,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:56:50,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055167767] [2019-11-15 19:56:50,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:56:50,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:50,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:56:50,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:56:50,183 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 19:56:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:51,084 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 19:56:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:56:51,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 19:56:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:51,216 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 19:56:51,217 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 19:56:51,217 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 19:56:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 19:56:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 19:56:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 19:56:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 19:56:53,249 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 19:56:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:53,249 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 19:56:53,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:56:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 19:56:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:56:53,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:53,268 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 19:56:53,268 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-15 19:56:53,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:53,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200777017] [2019-11-15 19:56:53,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:53,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:53,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:53,381 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 19:56:53,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200777017] [2019-11-15 19:56:53,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:53,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:56:53,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213854831] [2019-11-15 19:56:53,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:56:53,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:56:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:56:53,383 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-15 19:56:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:54,547 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-15 19:56:54,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:56:54,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 19:56:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:54,699 INFO L225 Difference]: With dead ends: 83684 [2019-11-15 19:56:54,699 INFO L226 Difference]: Without dead ends: 83684 [2019-11-15 19:56:54,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:56:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-15 19:56:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-15 19:56:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-15 19:56:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-15 19:56:59,678 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-15 19:56:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:59,678 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-15 19:56:59,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:56:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-15 19:56:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:56:59,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:59,690 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 19:56:59,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:56:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-15 19:56:59,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:59,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867040689] [2019-11-15 19:56:59,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:59,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:59,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:59,772 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 19:56:59,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867040689] [2019-11-15 19:56:59,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:59,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:56:59,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043229407] [2019-11-15 19:56:59,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:56:59,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:56:59,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:56:59,773 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-11-15 19:57:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:00,011 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-15 19:57:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:57:00,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 19:57:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:00,114 INFO L225 Difference]: With dead ends: 54020 [2019-11-15 19:57:00,115 INFO L226 Difference]: Without dead ends: 54020 [2019-11-15 19:57:00,115 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 19:57:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-15 19:57:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-15 19:57:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-15 19:57:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-15 19:57:01,023 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-15 19:57:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:01,023 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-15 19:57:01,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:57:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-15 19:57:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:57:01,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:01,033 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 19:57:01,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:01,033 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-15 19:57:01,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:01,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173810134] [2019-11-15 19:57:01,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:01,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:01,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:01,128 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 19:57:01,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173810134] [2019-11-15 19:57:01,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:01,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:01,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948087483] [2019-11-15 19:57:01,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:01,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:01,130 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-15 19:57:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:01,832 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-15 19:57:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 19:57:01,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 19:57:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:01,959 INFO L225 Difference]: With dead ends: 68645 [2019-11-15 19:57:01,959 INFO L226 Difference]: Without dead ends: 68077 [2019-11-15 19:57:01,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 19:57:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-15 19:57:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-15 19:57:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-15 19:57:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-15 19:57:03,737 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-15 19:57:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:03,737 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-15 19:57:03,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-15 19:57:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 19:57:03,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:03,747 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] [2019-11-15 19:57:03,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1423918431, now seen corresponding path program 1 times [2019-11-15 19:57:03,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:03,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635987582] [2019-11-15 19:57:03,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:03,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:03,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:03,845 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 19:57:03,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635987582] [2019-11-15 19:57:03,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:03,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:03,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665641414] [2019-11-15 19:57:03,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:03,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:03,849 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-11-15 19:57:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:04,623 INFO L93 Difference]: Finished difference Result 96424 states and 331752 transitions. [2019-11-15 19:57:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:57:04,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 19:57:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:04,802 INFO L225 Difference]: With dead ends: 96424 [2019-11-15 19:57:04,802 INFO L226 Difference]: Without dead ends: 96424 [2019-11-15 19:57:04,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:57:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96424 states. [2019-11-15 19:57:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96424 to 70773. [2019-11-15 19:57:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70773 states. [2019-11-15 19:57:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70773 states to 70773 states and 244809 transitions. [2019-11-15 19:57:06,162 INFO L78 Accepts]: Start accepts. Automaton has 70773 states and 244809 transitions. Word has length 53 [2019-11-15 19:57:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:06,163 INFO L462 AbstractCegarLoop]: Abstraction has 70773 states and 244809 transitions. [2019-11-15 19:57:06,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 70773 states and 244809 transitions. [2019-11-15 19:57:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 19:57:06,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:06,174 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] [2019-11-15 19:57:06,174 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash -536414750, now seen corresponding path program 1 times [2019-11-15 19:57:06,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:06,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298533694] [2019-11-15 19:57:06,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:06,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:06,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:06,248 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 19:57:06,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298533694] [2019-11-15 19:57:06,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:06,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:57:06,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220698947] [2019-11-15 19:57:06,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:57:06,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:57:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:57:06,250 INFO L87 Difference]: Start difference. First operand 70773 states and 244809 transitions. Second operand 4 states. [2019-11-15 19:57:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:06,305 INFO L93 Difference]: Finished difference Result 12386 states and 37621 transitions. [2019-11-15 19:57:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:57:06,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 19:57:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:06,318 INFO L225 Difference]: With dead ends: 12386 [2019-11-15 19:57:06,318 INFO L226 Difference]: Without dead ends: 10681 [2019-11-15 19:57:06,318 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 19:57:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10681 states. [2019-11-15 19:57:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10681 to 10633. [2019-11-15 19:57:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2019-11-15 19:57:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 31700 transitions. [2019-11-15 19:57:06,444 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 31700 transitions. Word has length 53 [2019-11-15 19:57:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:06,444 INFO L462 AbstractCegarLoop]: Abstraction has 10633 states and 31700 transitions. [2019-11-15 19:57:06,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:57:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 31700 transitions. [2019-11-15 19:57:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 19:57:06,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:06,447 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 19:57:06,447 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-15 19:57:06,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:06,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802274887] [2019-11-15 19:57:06,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:06,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:06,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:06,505 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 19:57:06,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802274887] [2019-11-15 19:57:06,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:06,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:57:06,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349303066] [2019-11-15 19:57:06,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:57:06,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:06,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:57:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:57:06,507 INFO L87 Difference]: Start difference. First operand 10633 states and 31700 transitions. Second operand 4 states. [2019-11-15 19:57:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:06,931 INFO L93 Difference]: Finished difference Result 12165 states and 36338 transitions. [2019-11-15 19:57:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:57:06,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 19:57:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:06,944 INFO L225 Difference]: With dead ends: 12165 [2019-11-15 19:57:06,945 INFO L226 Difference]: Without dead ends: 12165 [2019-11-15 19:57:06,945 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 19:57:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-11-15 19:57:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10963. [2019-11-15 19:57:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10963 states. [2019-11-15 19:57:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10963 states to 10963 states and 32702 transitions. [2019-11-15 19:57:07,076 INFO L78 Accepts]: Start accepts. Automaton has 10963 states and 32702 transitions. Word has length 60 [2019-11-15 19:57:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:07,076 INFO L462 AbstractCegarLoop]: Abstraction has 10963 states and 32702 transitions. [2019-11-15 19:57:07,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:57:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 10963 states and 32702 transitions. [2019-11-15 19:57:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 19:57:07,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:07,079 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 19:57:07,079 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-15 19:57:07,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:07,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144879137] [2019-11-15 19:57:07,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:07,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:07,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:07,143 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 19:57:07,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144879137] [2019-11-15 19:57:07,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:07,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:07,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242293335] [2019-11-15 19:57:07,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:07,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:07,145 INFO L87 Difference]: Start difference. First operand 10963 states and 32702 transitions. Second operand 6 states. [2019-11-15 19:57:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:07,498 INFO L93 Difference]: Finished difference Result 13789 states and 40570 transitions. [2019-11-15 19:57:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 19:57:07,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 19:57:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:07,514 INFO L225 Difference]: With dead ends: 13789 [2019-11-15 19:57:07,514 INFO L226 Difference]: Without dead ends: 13728 [2019-11-15 19:57:07,515 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 19:57:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13728 states. [2019-11-15 19:57:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13728 to 12854. [2019-11-15 19:57:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12854 states. [2019-11-15 19:57:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12854 states to 12854 states and 38040 transitions. [2019-11-15 19:57:07,670 INFO L78 Accepts]: Start accepts. Automaton has 12854 states and 38040 transitions. Word has length 60 [2019-11-15 19:57:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:07,670 INFO L462 AbstractCegarLoop]: Abstraction has 12854 states and 38040 transitions. [2019-11-15 19:57:07,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12854 states and 38040 transitions. [2019-11-15 19:57:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:07,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:07,676 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 19:57:07,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1081136040, now seen corresponding path program 1 times [2019-11-15 19:57:07,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:07,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639882753] [2019-11-15 19:57:07,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:07,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:07,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:07,729 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 19:57:07,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639882753] [2019-11-15 19:57:07,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:07,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:57:07,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139586822] [2019-11-15 19:57:07,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:57:07,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:57:07,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:57:07,731 INFO L87 Difference]: Start difference. First operand 12854 states and 38040 transitions. Second operand 4 states. [2019-11-15 19:57:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:08,019 INFO L93 Difference]: Finished difference Result 15947 states and 46763 transitions. [2019-11-15 19:57:08,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:57:08,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 19:57:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:08,038 INFO L225 Difference]: With dead ends: 15947 [2019-11-15 19:57:08,038 INFO L226 Difference]: Without dead ends: 15947 [2019-11-15 19:57:08,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 19:57:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-11-15 19:57:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 14216. [2019-11-15 19:57:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-11-15 19:57:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 41815 transitions. [2019-11-15 19:57:08,212 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 41815 transitions. Word has length 66 [2019-11-15 19:57:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:08,212 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 41815 transitions. [2019-11-15 19:57:08,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:57:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 41815 transitions. [2019-11-15 19:57:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:08,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:08,219 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 19:57:08,219 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1969066775, now seen corresponding path program 1 times [2019-11-15 19:57:08,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:08,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120799549] [2019-11-15 19:57:08,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:08,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:08,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:08,310 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 19:57:08,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120799549] [2019-11-15 19:57:08,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:08,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:08,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100049450] [2019-11-15 19:57:08,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:08,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:08,311 INFO L87 Difference]: Start difference. First operand 14216 states and 41815 transitions. Second operand 6 states. [2019-11-15 19:57:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:08,868 INFO L93 Difference]: Finished difference Result 15413 states and 44700 transitions. [2019-11-15 19:57:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 19:57:08,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 19:57:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:08,887 INFO L225 Difference]: With dead ends: 15413 [2019-11-15 19:57:08,887 INFO L226 Difference]: Without dead ends: 15413 [2019-11-15 19:57:08,887 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 19:57:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15413 states. [2019-11-15 19:57:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15413 to 15089. [2019-11-15 19:57:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2019-11-15 19:57:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 43878 transitions. [2019-11-15 19:57:09,061 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 43878 transitions. Word has length 66 [2019-11-15 19:57:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:09,062 INFO L462 AbstractCegarLoop]: Abstraction has 15089 states and 43878 transitions. [2019-11-15 19:57:09,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 43878 transitions. [2019-11-15 19:57:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:09,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:09,070 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 19:57:09,070 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1007452758, now seen corresponding path program 1 times [2019-11-15 19:57:09,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:09,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463527420] [2019-11-15 19:57:09,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:09,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:09,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:09,151 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 19:57:09,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463527420] [2019-11-15 19:57:09,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:09,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:09,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608087536] [2019-11-15 19:57:09,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:09,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:09,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:09,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:09,152 INFO L87 Difference]: Start difference. First operand 15089 states and 43878 transitions. Second operand 6 states. [2019-11-15 19:57:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:09,619 INFO L93 Difference]: Finished difference Result 17155 states and 48592 transitions. [2019-11-15 19:57:09,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:57:09,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 19:57:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:09,645 INFO L225 Difference]: With dead ends: 17155 [2019-11-15 19:57:09,646 INFO L226 Difference]: Without dead ends: 17155 [2019-11-15 19:57:09,646 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 19:57:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2019-11-15 19:57:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 15619. [2019-11-15 19:57:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15619 states. [2019-11-15 19:57:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15619 states to 15619 states and 44726 transitions. [2019-11-15 19:57:09,868 INFO L78 Accepts]: Start accepts. Automaton has 15619 states and 44726 transitions. Word has length 66 [2019-11-15 19:57:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:09,868 INFO L462 AbstractCegarLoop]: Abstraction has 15619 states and 44726 transitions. [2019-11-15 19:57:09,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15619 states and 44726 transitions. [2019-11-15 19:57:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:09,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:09,877 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 19:57:09,877 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:09,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:09,877 INFO L82 PathProgramCache]: Analyzing trace with hash -796101845, now seen corresponding path program 1 times [2019-11-15 19:57:09,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:09,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256373072] [2019-11-15 19:57:09,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:09,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:09,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:09,935 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 19:57:09,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256373072] [2019-11-15 19:57:09,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:09,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:09,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142001283] [2019-11-15 19:57:09,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:09,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:09,937 INFO L87 Difference]: Start difference. First operand 15619 states and 44726 transitions. Second operand 5 states. [2019-11-15 19:57:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:10,283 INFO L93 Difference]: Finished difference Result 19634 states and 55999 transitions. [2019-11-15 19:57:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:57:10,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 19:57:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:10,305 INFO L225 Difference]: With dead ends: 19634 [2019-11-15 19:57:10,305 INFO L226 Difference]: Without dead ends: 19634 [2019-11-15 19:57:10,305 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 19:57:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2019-11-15 19:57:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 18191. [2019-11-15 19:57:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-11-15 19:57:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 51753 transitions. [2019-11-15 19:57:10,528 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 51753 transitions. Word has length 66 [2019-11-15 19:57:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:10,528 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 51753 transitions. [2019-11-15 19:57:10,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 51753 transitions. [2019-11-15 19:57:10,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:10,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:10,538 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 19:57:10,538 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1306636022, now seen corresponding path program 1 times [2019-11-15 19:57:10,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:10,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373139299] [2019-11-15 19:57:10,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:10,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:10,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:10,588 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 19:57:10,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373139299] [2019-11-15 19:57:10,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:10,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:57:10,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452902587] [2019-11-15 19:57:10,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:57:10,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:10,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:57:10,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:57:10,591 INFO L87 Difference]: Start difference. First operand 18191 states and 51753 transitions. Second operand 4 states. [2019-11-15 19:57:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:11,120 INFO L93 Difference]: Finished difference Result 21605 states and 61304 transitions. [2019-11-15 19:57:11,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:57:11,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 19:57:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:11,144 INFO L225 Difference]: With dead ends: 21605 [2019-11-15 19:57:11,144 INFO L226 Difference]: Without dead ends: 21383 [2019-11-15 19:57:11,145 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 19:57:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21383 states. [2019-11-15 19:57:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21383 to 20513. [2019-11-15 19:57:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2019-11-15 19:57:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 58140 transitions. [2019-11-15 19:57:11,391 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 58140 transitions. Word has length 66 [2019-11-15 19:57:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:11,392 INFO L462 AbstractCegarLoop]: Abstraction has 20513 states and 58140 transitions. [2019-11-15 19:57:11,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:57:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 58140 transitions. [2019-11-15 19:57:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:11,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:11,398 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 19:57:11,399 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:11,399 INFO L82 PathProgramCache]: Analyzing trace with hash 303876234, now seen corresponding path program 1 times [2019-11-15 19:57:11,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:11,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956063082] [2019-11-15 19:57:11,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:11,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:11,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:11,521 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 19:57:11,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956063082] [2019-11-15 19:57:11,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:11,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 19:57:11,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759333592] [2019-11-15 19:57:11,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 19:57:11,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 19:57:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:57:11,523 INFO L87 Difference]: Start difference. First operand 20513 states and 58140 transitions. Second operand 9 states. [2019-11-15 19:57:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:12,610 INFO L93 Difference]: Finished difference Result 27608 states and 77920 transitions. [2019-11-15 19:57:12,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 19:57:12,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-15 19:57:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:12,644 INFO L225 Difference]: With dead ends: 27608 [2019-11-15 19:57:12,644 INFO L226 Difference]: Without dead ends: 27608 [2019-11-15 19:57:12,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:57:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2019-11-15 19:57:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 23102. [2019-11-15 19:57:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23102 states. [2019-11-15 19:57:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23102 states to 23102 states and 65204 transitions. [2019-11-15 19:57:12,934 INFO L78 Accepts]: Start accepts. Automaton has 23102 states and 65204 transitions. Word has length 66 [2019-11-15 19:57:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:12,934 INFO L462 AbstractCegarLoop]: Abstraction has 23102 states and 65204 transitions. [2019-11-15 19:57:12,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 19:57:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23102 states and 65204 transitions. [2019-11-15 19:57:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:12,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:12,940 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 19:57:12,941 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1191379915, now seen corresponding path program 1 times [2019-11-15 19:57:12,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:12,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023673864] [2019-11-15 19:57:12,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:12,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:12,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:13,008 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 19:57:13,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023673864] [2019-11-15 19:57:13,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:13,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:13,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905077685] [2019-11-15 19:57:13,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:13,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:13,009 INFO L87 Difference]: Start difference. First operand 23102 states and 65204 transitions. Second operand 5 states. [2019-11-15 19:57:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:13,057 INFO L93 Difference]: Finished difference Result 6392 states and 15091 transitions. [2019-11-15 19:57:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:57:13,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 19:57:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:13,062 INFO L225 Difference]: With dead ends: 6392 [2019-11-15 19:57:13,062 INFO L226 Difference]: Without dead ends: 5432 [2019-11-15 19:57:13,063 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 19:57:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2019-11-15 19:57:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 4684. [2019-11-15 19:57:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-11-15 19:57:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 10759 transitions. [2019-11-15 19:57:13,106 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 10759 transitions. Word has length 66 [2019-11-15 19:57:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:13,106 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 10759 transitions. [2019-11-15 19:57:13,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 10759 transitions. [2019-11-15 19:57:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:57:13,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:13,109 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 19:57:13,109 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-15 19:57:13,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:13,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878481093] [2019-11-15 19:57:13,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:13,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:13,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:13,139 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 19:57:13,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878481093] [2019-11-15 19:57:13,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:13,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:57:13,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024555607] [2019-11-15 19:57:13,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:57:13,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:13,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:57:13,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:57:13,141 INFO L87 Difference]: Start difference. First operand 4684 states and 10759 transitions. Second operand 3 states. [2019-11-15 19:57:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:13,174 INFO L93 Difference]: Finished difference Result 5801 states and 13142 transitions. [2019-11-15 19:57:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:57:13,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 19:57:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:13,179 INFO L225 Difference]: With dead ends: 5801 [2019-11-15 19:57:13,179 INFO L226 Difference]: Without dead ends: 5801 [2019-11-15 19:57:13,179 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 19:57:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-11-15 19:57:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 4607. [2019-11-15 19:57:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-11-15 19:57:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 10306 transitions. [2019-11-15 19:57:13,223 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 10306 transitions. Word has length 66 [2019-11-15 19:57:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:13,223 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 10306 transitions. [2019-11-15 19:57:13,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:57:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 10306 transitions. [2019-11-15 19:57:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 19:57:13,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:13,227 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 19:57:13,227 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-15 19:57:13,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:13,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994181160] [2019-11-15 19:57:13,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:13,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:13,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:13,280 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 19:57:13,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994181160] [2019-11-15 19:57:13,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:13,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:13,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292448034] [2019-11-15 19:57:13,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:13,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:13,282 INFO L87 Difference]: Start difference. First operand 4607 states and 10306 transitions. Second operand 5 states. [2019-11-15 19:57:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:13,439 INFO L93 Difference]: Finished difference Result 5678 states and 12754 transitions. [2019-11-15 19:57:13,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:57:13,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 19:57:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:13,445 INFO L225 Difference]: With dead ends: 5678 [2019-11-15 19:57:13,445 INFO L226 Difference]: Without dead ends: 5678 [2019-11-15 19:57:13,445 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 19:57:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2019-11-15 19:57:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5027. [2019-11-15 19:57:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-15 19:57:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 11264 transitions. [2019-11-15 19:57:13,513 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 11264 transitions. Word has length 72 [2019-11-15 19:57:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:13,514 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 11264 transitions. [2019-11-15 19:57:13,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 11264 transitions. [2019-11-15 19:57:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 19:57:13,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:13,519 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 19:57:13,519 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-15 19:57:13,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:13,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877023297] [2019-11-15 19:57:13,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:13,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:13,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:13,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 19:57:13,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877023297] [2019-11-15 19:57:13,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:13,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:57:13,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003434795] [2019-11-15 19:57:13,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:57:13,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:57:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:57:13,600 INFO L87 Difference]: Start difference. First operand 5027 states and 11264 transitions. Second operand 7 states. [2019-11-15 19:57:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:14,037 INFO L93 Difference]: Finished difference Result 5893 states and 13110 transitions. [2019-11-15 19:57:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 19:57:14,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 19:57:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:14,043 INFO L225 Difference]: With dead ends: 5893 [2019-11-15 19:57:14,043 INFO L226 Difference]: Without dead ends: 5840 [2019-11-15 19:57:14,044 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 19:57:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2019-11-15 19:57:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5058. [2019-11-15 19:57:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5058 states. [2019-11-15 19:57:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 11264 transitions. [2019-11-15 19:57:14,110 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 11264 transitions. Word has length 72 [2019-11-15 19:57:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:14,110 INFO L462 AbstractCegarLoop]: Abstraction has 5058 states and 11264 transitions. [2019-11-15 19:57:14,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:57:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 11264 transitions. [2019-11-15 19:57:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 19:57:14,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:14,116 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 19:57:14,117 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1081005229, now seen corresponding path program 1 times [2019-11-15 19:57:14,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:14,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125686665] [2019-11-15 19:57:14,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:14,172 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 19:57:14,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125686665] [2019-11-15 19:57:14,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:14,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:57:14,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561307509] [2019-11-15 19:57:14,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:57:14,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:57:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:57:14,176 INFO L87 Difference]: Start difference. First operand 5058 states and 11264 transitions. Second operand 4 states. [2019-11-15 19:57:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:14,298 INFO L93 Difference]: Finished difference Result 6057 states and 13398 transitions. [2019-11-15 19:57:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:57:14,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 19:57:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:14,305 INFO L225 Difference]: With dead ends: 6057 [2019-11-15 19:57:14,305 INFO L226 Difference]: Without dead ends: 6057 [2019-11-15 19:57:14,305 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 19:57:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2019-11-15 19:57:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 5344. [2019-11-15 19:57:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 19:57:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 11888 transitions. [2019-11-15 19:57:14,376 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 11888 transitions. Word has length 93 [2019-11-15 19:57:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:14,376 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 11888 transitions. [2019-11-15 19:57:14,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:57:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 11888 transitions. [2019-11-15 19:57:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:14,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:14,382 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 19:57:14,383 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 851773125, now seen corresponding path program 1 times [2019-11-15 19:57:14,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:14,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762979246] [2019-11-15 19:57:14,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:14,445 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 19:57:14,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762979246] [2019-11-15 19:57:14,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:14,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:14,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741492717] [2019-11-15 19:57:14,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:14,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:14,448 INFO L87 Difference]: Start difference. First operand 5344 states and 11888 transitions. Second operand 5 states. [2019-11-15 19:57:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:14,596 INFO L93 Difference]: Finished difference Result 5833 states and 12951 transitions. [2019-11-15 19:57:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:57:14,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 19:57:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:14,599 INFO L225 Difference]: With dead ends: 5833 [2019-11-15 19:57:14,600 INFO L226 Difference]: Without dead ends: 5833 [2019-11-15 19:57:14,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 19:57:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2019-11-15 19:57:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 4469. [2019-11-15 19:57:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4469 states. [2019-11-15 19:57:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 9934 transitions. [2019-11-15 19:57:14,641 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 9934 transitions. Word has length 95 [2019-11-15 19:57:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:14,641 INFO L462 AbstractCegarLoop]: Abstraction has 4469 states and 9934 transitions. [2019-11-15 19:57:14,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 9934 transitions. [2019-11-15 19:57:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:14,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:14,645 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 19:57:14,645 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1717713274, now seen corresponding path program 1 times [2019-11-15 19:57:14,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:14,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028309699] [2019-11-15 19:57:14,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:14,702 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 19:57:14,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028309699] [2019-11-15 19:57:14,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:14,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:14,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399805685] [2019-11-15 19:57:14,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:14,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:14,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:14,704 INFO L87 Difference]: Start difference. First operand 4469 states and 9934 transitions. Second operand 5 states. [2019-11-15 19:57:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:15,130 INFO L93 Difference]: Finished difference Result 7505 states and 16774 transitions. [2019-11-15 19:57:15,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:57:15,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 19:57:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:15,136 INFO L225 Difference]: With dead ends: 7505 [2019-11-15 19:57:15,136 INFO L226 Difference]: Without dead ends: 7487 [2019-11-15 19:57:15,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:57:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7487 states. [2019-11-15 19:57:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7487 to 5596. [2019-11-15 19:57:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5596 states. [2019-11-15 19:57:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 12579 transitions. [2019-11-15 19:57:15,194 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 12579 transitions. Word has length 95 [2019-11-15 19:57:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:15,194 INFO L462 AbstractCegarLoop]: Abstraction has 5596 states and 12579 transitions. [2019-11-15 19:57:15,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 12579 transitions. [2019-11-15 19:57:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:15,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:15,200 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 19:57:15,201 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash -261597880, now seen corresponding path program 1 times [2019-11-15 19:57:15,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:15,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959218215] [2019-11-15 19:57:15,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:15,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:15,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:15,276 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 19:57:15,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959218215] [2019-11-15 19:57:15,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:15,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:15,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298962332] [2019-11-15 19:57:15,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:15,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:15,279 INFO L87 Difference]: Start difference. First operand 5596 states and 12579 transitions. Second operand 5 states. [2019-11-15 19:57:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:15,591 INFO L93 Difference]: Finished difference Result 6902 states and 15357 transitions. [2019-11-15 19:57:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:57:15,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 19:57:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:15,597 INFO L225 Difference]: With dead ends: 6902 [2019-11-15 19:57:15,597 INFO L226 Difference]: Without dead ends: 6798 [2019-11-15 19:57:15,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6798 states. [2019-11-15 19:57:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6798 to 5933. [2019-11-15 19:57:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5933 states. [2019-11-15 19:57:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5933 states to 5933 states and 13266 transitions. [2019-11-15 19:57:15,654 INFO L78 Accepts]: Start accepts. Automaton has 5933 states and 13266 transitions. Word has length 95 [2019-11-15 19:57:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:15,654 INFO L462 AbstractCegarLoop]: Abstraction has 5933 states and 13266 transitions. [2019-11-15 19:57:15,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 5933 states and 13266 transitions. [2019-11-15 19:57:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:15,660 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:15,661 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 19:57:15,661 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash -814656768, now seen corresponding path program 2 times [2019-11-15 19:57:15,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:15,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023404730] [2019-11-15 19:57:15,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:15,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:15,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:15,719 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 19:57:15,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023404730] [2019-11-15 19:57:15,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:15,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:15,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254221379] [2019-11-15 19:57:15,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:15,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:15,721 INFO L87 Difference]: Start difference. First operand 5933 states and 13266 transitions. Second operand 5 states. [2019-11-15 19:57:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:15,921 INFO L93 Difference]: Finished difference Result 6291 states and 13909 transitions. [2019-11-15 19:57:15,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:57:15,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 19:57:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:15,926 INFO L225 Difference]: With dead ends: 6291 [2019-11-15 19:57:15,926 INFO L226 Difference]: Without dead ends: 6253 [2019-11-15 19:57:15,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:57:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2019-11-15 19:57:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 5845. [2019-11-15 19:57:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5845 states. [2019-11-15 19:57:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5845 states to 5845 states and 12953 transitions. [2019-11-15 19:57:15,980 INFO L78 Accepts]: Start accepts. Automaton has 5845 states and 12953 transitions. Word has length 95 [2019-11-15 19:57:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:15,980 INFO L462 AbstractCegarLoop]: Abstraction has 5845 states and 12953 transitions. [2019-11-15 19:57:15,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5845 states and 12953 transitions. [2019-11-15 19:57:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:15,986 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:15,986 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 19:57:15,986 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:15,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1706397147, now seen corresponding path program 1 times [2019-11-15 19:57:15,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:15,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87157299] [2019-11-15 19:57:15,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:15,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:15,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:16,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 19:57:16,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87157299] [2019-11-15 19:57:16,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:16,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:57:16,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625362646] [2019-11-15 19:57:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:16,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:16,057 INFO L87 Difference]: Start difference. First operand 5845 states and 12953 transitions. Second operand 6 states. [2019-11-15 19:57:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:16,413 INFO L93 Difference]: Finished difference Result 7258 states and 15945 transitions. [2019-11-15 19:57:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 19:57:16,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 19:57:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:16,421 INFO L225 Difference]: With dead ends: 7258 [2019-11-15 19:57:16,421 INFO L226 Difference]: Without dead ends: 7231 [2019-11-15 19:57:16,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 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 19:57:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7231 states. [2019-11-15 19:57:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7231 to 5444. [2019-11-15 19:57:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5444 states. [2019-11-15 19:57:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 12084 transitions. [2019-11-15 19:57:16,501 INFO L78 Accepts]: Start accepts. Automaton has 5444 states and 12084 transitions. Word has length 95 [2019-11-15 19:57:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:16,501 INFO L462 AbstractCegarLoop]: Abstraction has 5444 states and 12084 transitions. [2019-11-15 19:57:16,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5444 states and 12084 transitions. [2019-11-15 19:57:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:16,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:16,507 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 19:57:16,507 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:16,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash -250281753, now seen corresponding path program 1 times [2019-11-15 19:57:16,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:16,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502986406] [2019-11-15 19:57:16,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:16,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:16,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:16,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502986406] [2019-11-15 19:57:16,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:16,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 19:57:16,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134506366] [2019-11-15 19:57:16,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:57:16,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:57:16,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:57:16,642 INFO L87 Difference]: Start difference. First operand 5444 states and 12084 transitions. Second operand 8 states. [2019-11-15 19:57:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:17,154 INFO L93 Difference]: Finished difference Result 6974 states and 15380 transitions. [2019-11-15 19:57:17,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:57:17,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 19:57:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:17,160 INFO L225 Difference]: With dead ends: 6974 [2019-11-15 19:57:17,160 INFO L226 Difference]: Without dead ends: 6914 [2019-11-15 19:57:17,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-15 19:57:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6914 states. [2019-11-15 19:57:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6914 to 5850. [2019-11-15 19:57:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-11-15 19:57:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 12999 transitions. [2019-11-15 19:57:17,216 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 12999 transitions. Word has length 95 [2019-11-15 19:57:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:17,216 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 12999 transitions. [2019-11-15 19:57:17,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:57:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 12999 transitions. [2019-11-15 19:57:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:17,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:17,220 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 19:57:17,220 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:17,220 INFO L82 PathProgramCache]: Analyzing trace with hash -219261946, now seen corresponding path program 1 times [2019-11-15 19:57:17,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:17,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150583293] [2019-11-15 19:57:17,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:17,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:17,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:17,314 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 19:57:17,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150583293] [2019-11-15 19:57:17,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:17,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:17,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214346170] [2019-11-15 19:57:17,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:57:17,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:17,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:17,316 INFO L87 Difference]: Start difference. First operand 5850 states and 12999 transitions. Second operand 5 states. [2019-11-15 19:57:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:17,361 INFO L93 Difference]: Finished difference Result 5769 states and 12783 transitions. [2019-11-15 19:57:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:57:17,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 19:57:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:17,367 INFO L225 Difference]: With dead ends: 5769 [2019-11-15 19:57:17,367 INFO L226 Difference]: Without dead ends: 5769 [2019-11-15 19:57:17,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-11-15 19:57:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5537. [2019-11-15 19:57:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5537 states. [2019-11-15 19:57:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 12268 transitions. [2019-11-15 19:57:17,436 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 12268 transitions. Word has length 95 [2019-11-15 19:57:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:17,437 INFO L462 AbstractCegarLoop]: Abstraction has 5537 states and 12268 transitions. [2019-11-15 19:57:17,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:57:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 12268 transitions. [2019-11-15 19:57:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:17,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:17,443 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 19:57:17,443 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash 668241735, now seen corresponding path program 1 times [2019-11-15 19:57:17,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:17,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855749136] [2019-11-15 19:57:17,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:17,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:17,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:17,579 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 19:57:17,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855749136] [2019-11-15 19:57:17,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:17,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 19:57:17,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166740454] [2019-11-15 19:57:17,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 19:57:17,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:57:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:57:17,581 INFO L87 Difference]: Start difference. First operand 5537 states and 12268 transitions. Second operand 10 states. [2019-11-15 19:57:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:18,033 INFO L93 Difference]: Finished difference Result 15994 states and 35928 transitions. [2019-11-15 19:57:18,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 19:57:18,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 19:57:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:18,045 INFO L225 Difference]: With dead ends: 15994 [2019-11-15 19:57:18,046 INFO L226 Difference]: Without dead ends: 11265 [2019-11-15 19:57:18,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:57:18,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11265 states. [2019-11-15 19:57:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11265 to 5561. [2019-11-15 19:57:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-15 19:57:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 12238 transitions. [2019-11-15 19:57:18,125 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 12238 transitions. Word has length 95 [2019-11-15 19:57:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:18,126 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 12238 transitions. [2019-11-15 19:57:18,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 19:57:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 12238 transitions. [2019-11-15 19:57:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:18,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:18,130 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 19:57:18,130 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1749651354, now seen corresponding path program 1 times [2019-11-15 19:57:18,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:18,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953067877] [2019-11-15 19:57:18,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:18,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:18,223 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 19:57:18,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953067877] [2019-11-15 19:57:18,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:18,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:57:18,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255238210] [2019-11-15 19:57:18,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:57:18,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:18,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:57:18,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:57:18,225 INFO L87 Difference]: Start difference. First operand 5561 states and 12238 transitions. Second operand 7 states. [2019-11-15 19:57:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:18,561 INFO L93 Difference]: Finished difference Result 5950 states and 13035 transitions. [2019-11-15 19:57:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:57:18,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 19:57:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:18,567 INFO L225 Difference]: With dead ends: 5950 [2019-11-15 19:57:18,567 INFO L226 Difference]: Without dead ends: 5950 [2019-11-15 19:57:18,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:57:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2019-11-15 19:57:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 5579. [2019-11-15 19:57:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2019-11-15 19:57:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 12269 transitions. [2019-11-15 19:57:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 12269 transitions. Word has length 95 [2019-11-15 19:57:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:18,637 INFO L462 AbstractCegarLoop]: Abstraction has 5579 states and 12269 transitions. [2019-11-15 19:57:18,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:57:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 12269 transitions. [2019-11-15 19:57:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 19:57:18,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:18,642 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 19:57:18,643 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:57:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2096619303, now seen corresponding path program 2 times [2019-11-15 19:57:18,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:18,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830476782] [2019-11-15 19:57:18,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:18,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:18,767 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:18,768 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 19:57:18,948 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 19:57:18,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 07:57:18 BasicIcfg [2019-11-15 19:57:18,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 19:57:18,952 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:57:18,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:57:18,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:57:18,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:56:36" (3/4) ... [2019-11-15 19:57:18,968 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 19:57:19,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_45f587f1-a8a4-4752-95e1-c5a96a661606/bin/uautomizer/witness.graphml [2019-11-15 19:57:19,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:57:19,147 INFO L168 Benchmark]: Toolchain (without parser) took 44293.83 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 939.4 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-15 19:57:19,148 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:19,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:19,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:19,149 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 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 19:57:19,149 INFO L168 Benchmark]: RCFGBuilder took 776.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:19,150 INFO L168 Benchmark]: TraceAbstraction took 42611.40 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 19:57:19,151 INFO L168 Benchmark]: Witness Printer took 193.09 ms. Allocated memory is still 5.1 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:19,153 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 614.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -181.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.16 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 776.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42611.40 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 193.09 ms. Allocated memory is still 5.1 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1551; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1551, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t1552; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t1552, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 42.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8780 SDtfs, 9746 SDslu, 20317 SDs, 0 SdLazy, 7924 SolverSat, 496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 95 SyntacticMatches, 18 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred 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: 20.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 108930 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2321 NumberOfCodeBlocks, 2321 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2194 ConstructedInterpolants, 0 QuantifiedInterpolants, 464382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...